Open Access
April 2013 Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis
Constantinos Daskalakis, Sebastien Roch
Ann. Appl. Probab. 23(2): 693-721 (April 2013). DOI: 10.1214/12-AAP852


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.


Download Citation

Constantinos Daskalakis. Sebastien Roch. "Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis." Ann. Appl. Probab. 23 (2) 693 - 721, April 2013.


Published: April 2013
First available in Project Euclid: 12 February 2013

zbMATH: 1377.92060
MathSciNet: MR3059273
Digital Object Identifier: 10.1214/12-AAP852

Primary: 60K35
Secondary: 92D15

Keywords: alignment , branching processes , phylogenetic reconstruction

Rights: Copyright © 2013 Institute of Mathematical Statistics

Vol.23 • No. 2 • April 2013
Back to Top