The neighbor-joining method: a new method for reconstructing phylogenetic trees.

@article{Saitou1987TheNM,
  title={The neighbor-joining method: a new method for reconstructing phylogenetic trees.},
  author={Naruya Saitou and Masatoshi Nei},
  journal={Molecular biology and evolution},
  year={1987},
  volume={4 4},
  pages={
          406-25
        }
}
  • N. Saitou, M. Nei
  • Published 1 July 1987
  • Biology
  • Molecular biology and evolution
A new method called the neighbor-joining method is proposed for reconstructing phylogenetic trees from evolutionary distance data. [] Key Method Using computer simulation, we studied the efficiency of this method in obtaining the correct unrooted tree in comparison with that of five other tree-making methods: the unweighted pair group method of analysis, Farris's method, Sattath and Tversky's method, Li's method, and Tateno et al.'s modified Farris method. The new, neighbor-joining method and Sattath and…

Figures and Tables from this paper

Two new distance based methods for phylogenetic tree reconstruction
  • Yong-Jun Ma, Zuguo Yu
  • Biology
    2011 4th International Conference on Biomedical Engineering and Informatics (BMEI)
  • 2011
TLDR
The results show that the DS method and mDLCA method perform same well as the NJ method, and are better than UPGMA and DLCA methods.
Random local neighbor joining: a new method for reconstructing phylogenetic trees.
Generalized neighbor-joining: more reliable phylogenetic tree reconstruction.
TLDR
This method is a generalization of the neighbor-joining method of Saitou and Nei and affords a more thorough sampling of the solution space by keeping track of multiple partial solutions during its execution, and can find lower-cost tree topologies and near-best treeTopology that are significantly different from the best topology.
NJML: a hybrid algorithm for the neighbor-joining and maximum-likelihood methods.
  • S. Ota, W. Li
  • Biology
    Molecular biology and evolution
  • 2000
TLDR
A "divide-and-conquer" heuristic algorithm in which an initial neighbor-joining (NJ) tree is divided into subtrees at internal branches having bootstrap values higher than a threshold, which is suitable for reconstructing relatively large molecular phylogenetic trees.
FastJoin, an improved neighbor-joining algorithm.
TLDR
A new method of reconstructing phylogenetic trees, FastJoin, was proposed, and experiments with sets of data showed that this new neighbor-joining algorithm yields a significant speed-up compared to classic neighbor- joining, showing empirically that FastJoin is superior to almost all other neighbor-joined implementations.
Improvement of distance-based phylogenetic methods by a local maximum likelihood approach using triplets.
TLDR
A new approach to estimate the evolutionary distance between two sequences using a tree with three leaves, which improves the precision of evolutionary distance estimates, and thus the topological accuracy of distance-based methods.
Property and efficiency of the maximum likelihood method for molecular phylogeny
  • N. Saitou
  • Biology
    Journal of Molecular Evolution
  • 2005
TLDR
It is shown that under the assumption of a constant rate of evolution, the ML method and UPGMA always give the same rooted tree for the case of three operational taxonomic units (OTUs) and this also seems to hold approximately for the cases with four OTUs.
A Simple Method for Estimating and Testing Minimum-Evolution Trees
TLDR
Both a mathematical method for computing the number of trees with a given value of topological difference from the NJ tree and a computer algorithm for identifying all the topologies are developed.
Fast neighbor joining
Recrafting the neighbor-joining method
TLDR
This paper presents techniques for speeding up the canonical neighbor-joining method, and shows that the running time of the algorithms evolve as Θ(n2) on the examined instance collection, already for medium sized instances.
...
...

References

SHOWING 1-10 OF 25 REFERENCES
Simple method for constructing phylogenetic trees from distance matrices.
  • W. Li
  • Biology
    Proceedings of the National Academy of Sciences of the United States of America
  • 1981
TLDR
The present method appears to be preferable to the UPG method for analysis of data from populations that have not differentiated much and an application of the present method to gene frequency data from some Amerindian populations gives a tree topology far more reasonable than that obtained by theUPG method.
Accuracy of phylogenetic trees estimated from DNA sequence data.
TLDR
The relative merits of four different tree-making methods in obtaining the correct topology were studied by using computer simulation, finding that the unweighted pair-group method with arithmetic mean (UPGMA), Fitch and Margoliash's (FM), thd distance Wagner (DW) method, and Tateno et al.'s modified Farris (MF) method are at least as good as the other methods.
Distance Methods and the Approximation of Most-Parsimonious Trees
TLDR
The distance-Wagner algorithm is suggested as a possible heuristic method for the approximation of most-parsimonious trees from distance data and a new algorithm developed in this study compares favorably with not only the distance-wagner algorithms but also the character-W Wagner algorithm in the approximationof most- parsimoniously trees.
Estimating Phylogenetic Trees from Distance Matrices
TLDR
The distance Wagner procedure is applicable to data matrices of immunological distance, such as that of Sarich (1969a), in which between-OTU comparisons are evaluated but for which no attributes of the OTUs themselves are directly observable.
Molecular Evolutionary Genetics
TLDR
Recent developments of statistical methods in molecular phylogenetics are reviewed and it is shown that the mathematical foundations of these methods are not well established, but computer simulations and empirical data indicate that currently used methods produce reasonably good phylogenetic trees when a sufficiently large number of nucleotides or amino acids are used.
MINIMUM MUTATION FITS TO A GIVEN TREE
TLDR
A method of generating all such minimum mutation fits is described, which is the assignment which permits representation of the data in a minimum number of symbols, which seems compelling in its own right.
Additive similarity trees
TLDR
A computer program, ADDTREE, for the construction of additive trees is described and applied to several sets of data, and some empirical and theoretical advantages of tree representations over spatial representations of proximity data are illustrated.
Biochemical Systematics of Members of the Genus Rana Native to Western North America
TLDR
Two biochemical methods, starch gel electrophoresis and microcomplement fixation, have been used in an examination of the evolutionary relationships among western North American frogs of the genus Rana and indicate that the Rana boylii species group presently includes two very different evolutionary lineages.
...
...