@inproceedings{9572061140a242ed9af47c15ed6d3b9f,
title = "On the repeat-annotated phylogenetic tree reconstruction problem",
abstract = "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).",
author = "Firas Swidan and Michal Ziv-Ukelson and Pinter, {Ron Y.}",
year = "2006",
month = jan,
day = "1",
doi = "10.1007/11780441_14",
language = "English",
isbn = "3540354557",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "141--152",
booktitle = "Combinatorial Pattern Matching - 17th Annual Symposium, CPM 2006, Proceedings",
address = "Germany",
note = "17th Annual Symposium on Combinatorial Pattern Matching, CPM 2006 ; Conference date: 05-07-2006 Through 07-07-2006",
}