Alignment-Free Phylogenetic Reconstruction: Sample Complexity via a Branching Process Analysis

Details Alignment-Free Phylogenetic Reconstruction: Sample Complexity via a Branching Process Analysis Alignment-Free Phylogenetic Reconstruction: Sample Complexity via a Branching Process Analysis

2011-09-23

arxiv.org/abs/1109.5002v1

Mathematics

Probability

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Alignment-Free Phylogenetic Reconstruction: Sample Complexity via a Branching Process Analysis does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Alignment-Free Phylogenetic Reconstruction: Sample Complexity via a Branching Process Analysis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Alignment-Free Phylogenetic Reconstruction: Sample Complexity via a Branching Process Analysis will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-723972