Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis
Name
Daskalakis_Alignment-free.pdf
Size
380.35 KB
Format
Adobe PDF
Checksum (MD5)
a16b2aed67020c5be8ca34d75a76d1ef
Author(s)
Roch, Sebastien
Daskalakis, Konstantinos
Date Issued
April 2013
Journal
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
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
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.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1214/12-aap852
