Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep

Abstract Constantinos Daskalakis1 , Elchanan Mossel2, , and Sebastien Roch1 1 Microsoft Research 2 UC Berkeley and Weizman Institute We introduce a new phylogenetic reconstruction algorithm which, unlike most previous rigorous inference techniques, does not rely on assumptions regarding the branch lengths or the depth of the tree. The algorithm returns a forest which is guaranteed to contain all edges that are: 1) sufficiently long and 2) sufficiently close to the leaves. How much of the true tree is recovered depends on the sequence length provided. The algorithm is distance-based and runs in polynomial time.

• Type: Conference
• Year: 2009
• Where: RECOMB
• Authors: Constantinos Daskalakis, Elchanan Mossel, Sébastien Roch
• Keywords: Abstract Constantinos, Computational Biology, Phylogenetic Reconstruction Algorithm, RECOMB 2009, UC Berkeley