Provably Fast and Accurate Recovery of Evolutionary Trees through Harmonic Greedy Triplets

Details Provably Fast and Accurate Recovery of Evolutionary Trees through Harmonic Greedy Triplets Provably Fast and Accurate Recovery of Evolutionary Trees through Harmonic Greedy Triplets

2000-11-23

arxiv.org/abs/cs/0011038v1

Computer Science

Data Structures and Algorithms

The paper will appear in SIAM Journal on Computing

Scientific paper

We give a greedy learning algorithm for reconstructing an evolutionary tree based on a certain harmonic average on triplets of terminal taxa. After the pairwise distances between terminal taxa are estimated from sequence data, the algorithm runs in O(n^2) time using O(n) work space, where n is the number of terminal taxa. These time and space complexities are optimal in the sense that the size of an input distance matrix is n^2 and the size of an output tree is n. Moreover, in the Jukes-Cantor model of evolution, the algorithm recovers the correct tree topology with high probability using sample sequences of length polynomial in (1) n, (2) the logarithm of the error probability, and (3) the inverses of two small parameters.

Affiliated with

Also associated with

No associations

Rating

Provably Fast and Accurate Recovery of Evolutionary Trees through Harmonic Greedy Triplets 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 Provably Fast and Accurate Recovery of Evolutionary Trees through Harmonic Greedy Triplets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Provably Fast and Accurate Recovery of Evolutionary Trees through Harmonic Greedy Triplets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-729551