MBE Advance Access originally published online on July 28, 2006
Molecular Biology and Evolution 2006 23(11):1997-2000; doi:10.1093/molbev/msl072
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Review |
Neighbor-Joining Revealed

* LIRMM, Montpellier, France
Biomathematics Research Centre, University of Canterbury, Christchurch, New Zealand
E-mail: gascuel{at}lirmm.fr; M.Steel{at}math.canterbury.ac.nz.
It is nearly 20 years since the landmark paper (Saitou and Nei 1987) in Molecular Biology and Evolution introducing Neighbor-Joining (NJ). The method has become the most widely used method for building phylogenetic trees from distances, and the original paper has been cited about 13,000 times (Science Citation Index). Yet the question "what does the NJ method seek to do?" has until recently proved somewhat elusive, leading to some imprecise claims and misunderstanding. However, a rigorous answer to this question has recently been provided by further mathematical investigation, and the purpose of this note is to highlight these results and their significance for interpreting NJ. The origins of this story lie in a paper by Pauplin (2000) though its continuation has unfolded in more mathematically inclined literature. Our aim here is to make these findings more widely accessible.
Key Words: distance method algorithm phylogenetic criterion minimum evolution consistency Neighbor-Joining
![]()
CiteULike
Connotea
Del.icio.us What's this?
This article has been cited by other articles:
![]() |
O. Gillor, J. A. C. Vriezen, and M. A. Riley The role of SOS boxes in enteric bacteriocin regulation Microbiology, June 1, 2008; 154(6): 1783 - 1792. [Abstract] [Full Text] [PDF] |
||||
