Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep
Populations and Evolution
2011-09-30 v2 Computational Engineering, Finance, and Science
Data Structures and Algorithms
Probability
Statistics Theory
Statistics Theory
Abstract
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.
Keywords
Cite
@article{arxiv.0801.4190,
title = {Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep},
author = {Constantinos Daskalakis and Elchanan Mossel and Sebastien Roch},
journal= {arXiv preprint arXiv:0801.4190},
year = {2011}
}