Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis
Probability
2013-02-25 v2 Computational Engineering, Finance, and Science
Data Structures and Algorithms
Statistics Theory
Populations and Evolution
Statistics Theory
Abstract
We present an efficient phylogenetic reconstruction algorithm allowing insertions and deletions which provably achieves a sequence-length requirement (or sample complexity) growing polynomially in the number of taxa. Our algorithm is distance-based, that is, it relies on pairwise sequence comparisons. More importantly, our approach largely bypasses the difficult problem of multiple sequence alignment.
Cite
@article{arxiv.1109.5002,
title = {Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis},
author = {Constantinos Daskalakis and Sebastien Roch},
journal= {arXiv preprint arXiv:1109.5002},
year = {2013}
}
Comments
Published in at http://dx.doi.org/10.1214/12-AAP852 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)