Neighbor-Joining revealed

Type of content
Journal Article
Publisher's DOI/URI
Thesis discipline
Degree name
Publisher
University of Canterbury. Mathematics and Statistics.
Journal Title
Journal ISSN
Volume Title
Language
Date
2006
Authors
Gascuel, O.
Steel, M.
Abstract

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.

Description
Citation
Gascuel, O., Steel, M. (2006) Neighbor-Joining revealed. Molecular Biology and Evolution, 23(11), pp. 1997-2000.
Keywords
distance method, algorithm, phylogenetic criterion, minimum evolution, consistency, neighbor-joining
Ngā upoko tukutuku/Māori subject headings
ANZSRC fields of research
Rights