Neighbor-Joining Revealed

Olivier Gascuel 1, * Mike Steel 2
* Auteur correspondant
1 MAB - Méthodes et Algorithmes pour la Bioinformatique
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : It is nearly 20 years since the landmark paper (Saitou and Nei, 1987) in MBE 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.
Type de document :
Article dans une revue
Molecular Biology and Evolution, Oxford University Press (OUP), 2006, 23 (11), pp.1997-2000. 〈10.1093/molbev/msl072〉
Liste complète des métadonnées

Littérature citée [30 références]  Voir  Masquer  Télécharger
Contributeur : Olivier Gascuel <>
Soumis le : mercredi 5 septembre 2012 - 15:05:11
Dernière modification le : jeudi 24 mai 2018 - 15:59:22
Document(s) archivé(s) le : jeudi 6 décembre 2012 - 15:55:21


Fichiers éditeurs autorisés sur une archive ouverte




Olivier Gascuel, Mike Steel. Neighbor-Joining Revealed. Molecular Biology and Evolution, Oxford University Press (OUP), 2006, 23 (11), pp.1997-2000. 〈10.1093/molbev/msl072〉. 〈lirmm-00136653〉



Consultations de la notice


Téléchargements de fichiers