Fast error-tolerant quartet phylogeny algorithms

Details Fast error-tolerant quartet phylogeny algorithms Fast error-tolerant quartet phylogeny algorithms

2010-10-09

arxiv.org/abs/1010.1866v1

Biology

Quantitative Biology

Populations and Evolution

Scientific paper

We present an algorithm for phylogenetic reconstruction using quartets that returns the correct topology for $n$ taxa in $O(n \log n)$ time with high probability, in a probabilistic model where a quartet is not consistent with the true topology of the tree with constant probability, independent of other quartets. Our incremental algorithm relies upon a search tree structure for the phylogeny that is balanced, with high probability, no matter what the true topology is. Our experimental results show that our method is comparable in runtime to the fastest heuristics, while still offering consistency guarantees.

Affiliated with

Also associated with

No associations

Rating

Fast error-tolerant quartet phylogeny algorithms 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 Fast error-tolerant quartet phylogeny algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast error-tolerant quartet phylogeny algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-221300