
מיכל זיו-יוקלסון
אקדמי בכיר
On the repeat-annotated phylogenetic tree reconstruction problem
A new problem in phylogenetic inference is presented, based on recent biological findings indicating a strong association between reversals (i.e., inversions) and repeats. These biological findings are formalized here in a new mathematical model, called repeat-annotated phylogenetic trees (RAPT). We show that, under RAPT, the evolutionary process - including both the tree-topology as well as internal node genome orders - is uniquely determined, a property that is of major significance both in theory and in practice. Furthermore, the repeats are employed to provide linear-time algorithms for reconstructing both the genomic orders and the phylogeny, which are NP-hard problems under the classical model of sorting by reversals (SBR).
| שפת פרסום | אנגלית |
| דפים | 1397-1418 |
| כתב עת | Journal of Computational Biology |
| כרך | 13 |
| נושא מספר | 8 |
| סטטוס פרסום | פורסם - 01.10.2006 |
Keywords
Genome rearrangements
Phylogenetic inference
Repmaps
Set-tries
ASJC Scopus subject areas
Modeling and Simulation
Molecular Biology
Genetics
Computational Mathematics
Computational Theory and Mathematics