The infinite sites model of genome evolution
Open Access
- 23 September 2008
- journal article
- research article
- Published by Proceedings of the National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 105 (38) , 14254-14261
- https://doi.org/10.1073/pnas.0805217105
Abstract
We formalize the problem of recovering the evolutionary history of a set of genomes that are related to an unseen common ancestor genome by operations of speciation, deletion, insertion, duplication, and rearrangement of segments of bases. The problem is examined in the limit as the number of bases in each genome goes to infinity. In this limit, the chromosomes are represented by continuous circles or line segments. For such an infinite-sites model, we present a polynomial-time algorithm to find the most parsimonious evolutionary history of any set of related present-day genomes.Keywords
This publication has 42 references indexed in Scilit:
- DUPCAR: Reconstructing Contiguous Ancestral Regions with DuplicationsJournal of Computational Biology, 2008
- Mapping and sequencing of structural variation from eight human genomesNature, 2008
- Are There Rearrangement Hotspots in the Human Genome?PLoS Computational Biology, 2007
- Genome of the marsupial Monodelphis domestica reveals innovation in non-coding sequencesNature, 2007
- Using genomic data to unravel the root of the placental mammal phylogenyGenome Research, 2007
- Microinversions in mammalian evolutionProceedings of the National Academy of Sciences, 2006
- Reconstructing contiguous regions of an ancestral genomeGenome Research, 2006
- A 1.5-approximation algorithm for sorting by transpositions and transreversalsJournal of Computer and System Sciences, 2005
- A simple method for estimating evolutionary rates of base substitutions through comparative studies of nucleotide sequencesJournal of Molecular Evolution, 1980
- Additive evolutionary treesJournal of Theoretical Biology, 1977