מיכל זיו-יוקלסון

אקדמי בכיר

On the repeat-annotated phylogenetic tree reconstruction problem

Firas Swidan, Michal Ziv-Ukelson, Ron Y. Pinter

A new problem in phylogenetic inference is presented, based on recent biological findings indicating a strong association between reversals (aka inversions) and repeats. These biological findings are formalized here in a new mathematical model, called repeat-annotated phyImjenetic 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 practico. 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).

שפת פרסום אנגלית
דפים 141-152
סטטוס פרסום פורסם - 01.01.2006

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science
גישה למסמך
10.1007/11780441_14
קבצים וקישורים אחרים
Link to publication in Scopus