Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis
Author(s)
Roch, Sebastien; Daskalakis, Konstantinos
DownloadDaskalakis_Alignment-free.pdf (380.3Kb)
PUBLISHER_POLICY
Publisher Policy
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Terms of use
Metadata
Show full item recordAbstract
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.
Date issued
2013-04Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer ScienceJournal
The Annals of Applied Probability
Publisher
Institute of Mathematical Statistics
Citation
Daskalakis, Constantinos, and Sebastien Roch. “Alignment-Free Phylogenetic Reconstruction: Sample Complexity via a Branching Process Analysis.” The Annals of Applied Probability 23, no. 2 (April 2013): 693–721. © 2013 Institute of Mathematical Statistics
Version: Final published version
ISSN
1050-5164