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. © Springer-Verlag Berlin Heidelberg 2009.
CITATION STYLE
Daskalakis, C., Mossel, E., & Roch, S. (2009). Phylogenies without branch bounds: Contracting the short, pruning the deep extended abstract. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5541 LNBI, pp. 451–465). https://doi.org/10.1007/978-3-642-02008-7_32
Mendeley helps you to discover research relevant for your work.