Alignment-Free Phylogenetic Reconstruction

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. ∗ CSAIL, MIT. † Department of Mathematics and Bioinformatics Progam, UCLA. 

• Type: Conference
• Year: 2010
• Where: RECOMB
• Authors: Constantinos Daskalakis, Sébastien Roch
• Keywords: Algorithm Requires Sequence, Computational Biology, Evolution Allowing Insertions, Phylogenetic Reconstruction Algorithm, RECOMB 2010