We introduce the first polynomial-time phylogenetic reconstruction algorithm under a model of sequence evolution allowing insertions and deletions (or indels). Given appropriate assumptions, our algorithm requires sequence lengths growing polynomially in the number of leaf taxa. Our techniques are distance-based and largely bypass the problem of multiple alignment. © Springer-Verlag Berlin Heidelberg 2010.
CITATION STYLE
Daskalakis, C., & Roch, S. (2010). Alignment-free phylogenetic reconstruction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6044 LNBI, pp. 123–137). https://doi.org/10.1007/978-3-642-12683-3_9
Mendeley helps you to discover research relevant for your work.