, Volume 54, Issue 1, pp 1–24

Why Neighbor-Joining Works


DOI: 10.1007/s00453-007-9116-4

Cite this article as:
Mihaescu, R., Levy, D. & Pachter, L. Algorithmica (2009) 54: 1. doi:10.1007/s00453-007-9116-4


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.


Distance methods Edge radius Neighbor-joining Quartets 

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  1. 1.Department of Mathematics and Computer ScienceUC BerkeleyBerkeleyUSA

Personalised recommendations