TY - JOUR
T1 - The infinite sites model of genome evolution
AU - Ma, Jian
AU - Ratan, Aakrosh
AU - Raney, Brian J.
AU - Suh, Bernard B.
AU - Miller, Webb
AU - Haussler, David
PY - 2008/9/23
Y1 - 2008/9/23
N2 - 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.
AB - 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.
KW - Ancestral reconstruction
KW - Gene duplication
KW - Genome rearrangements
UR - http://www.scopus.com/inward/record.url?scp=55549136564&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=55549136564&partnerID=8YFLogxK
U2 - 10.1073/pnas.0805217105
DO - 10.1073/pnas.0805217105
M3 - Article
C2 - 18787111
AN - SCOPUS:55549136564
SN - 0027-8424
VL - 105
SP - 14254
EP - 14261
JO - Proceedings of the National Academy of Sciences of the United States of America
JF - Proceedings of the National Academy of Sciences of the United States of America
IS - 38
ER -