Why neighbor-joining works

Details Why neighbor-joining works Why neighbor-joining works

2006-02-10

arxiv.org/abs/cs/0602041v3

Computer Science

Data Structures and Algorithms

Revision 2

Scientific paper

We show that the neighbor-joining algorithm is a robust quartet method for constructing trees from distances. This leads to a new performance guarantee that contains Atteson's optimal radius bound as a special case and explains many cases where neighbor-joining is successful even when Atteson's criterion is not satisfied. We also provide a proof for Atteson's conjecture on the optimal edge radius of the neighbor-joining algorithm. The strong performance guarantees we provide also hold for the quadratic time fast neighbor-joining algorithm, thus providing a theoretical basis for inferring very large phylogenies with neighbor-joining.

Affiliated with

Also associated with

No associations

Rating

Why neighbor-joining works 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 Why neighbor-joining works, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Why neighbor-joining works will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-512625