Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis
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 comparison...
Main Authors: | Roch, Sebastien (Author), Daskalakis, Konstantinos (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
Institute of Mathematical Statistics,
2015-11-20T18:15:30Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Alignment-Free Phylogenetic Reconstruction
by: Daskalakis, Constantinos, et al.
Published: (2012) -
Global Alignment of Molecular Sequences via Ancestral State Reconstruction
by: Andoni, Alexandr, et al.
Published: (2012) -
SANS serif: Alignment-free, whole-genome-based phylogenetic reconstruction
by: Rempel, A., et al.
Published: (2021) -
Multiple Sequence Alignment via Phylogenetic Tree
by: Ta-Chin Hsu, et al.
Published: (2006) -
A greedy alignment-free distance estimator for phylogenetic inference
by: Sharma V. Thankachan, et al.
Published: (2017-06-01)