eCite Digital Repository
Neighbor-joining uses the optimal weight for net divergence
Citation
Charleston, MA and Hendy, MD and Penny, D, Neighbor-joining uses the optimal weight for net divergence, Molecular Phylogenetics and Evolution, 2, (1) pp. 6-12. ISSN 1055-7903 (1993) [Refereed Article]
Copyright Statement
Copyright 1993 by Academic Press
DOI: doi:10.1006/mpev.1993.1002
Abstract
A class of phylogenetic clustering methods which calculate net divergences from distance data, but assign differing weights to the net divergences, is defined. The class includes the Neighbor-Joining Method and the Unweighted Pair-Group Method with Arithmetic Mean. The accuracy of some of these methods is studied by computer simulation for the case of four taxa under the additive tree hypothesis. Of these methods and under this hypothesis, it is proved that Neighbor-Joining uses the only weighting for net divergence which is consistent, so that it is the only method in the class which is expected to converge to the correct tree as more data are added. Neighbor-Joining is then compared with Closest Tree on Distances for five taxa by simulation. It is proved that Closest Tree on Distances is equivalent to Neighbor-Joining for four taxa, though it is not when more than four taxa are considered.
Item Details
Item Type: | Refereed Article |
---|---|
Keywords: | phylogenetics, evolution |
Research Division: | Biological Sciences |
Research Group: | Bioinformatics and computational biology |
Research Field: | Computational ecology and phylogenetics |
Objective Division: | Expanding Knowledge |
Objective Group: | Expanding knowledge |
Objective Field: | Expanding knowledge in the biological sciences |
UTAS Author: | Charleston, MA (Professor Michael Charleston) |
ID Code: | 149731 |
Year Published: | 1993 |
Web of Science® Times Cited: | 8 |
Deposited By: | Mathematics |
Deposited On: | 2022-04-08 |
Last Modified: | 2022-05-26 |
Downloads: | 0 |
Repository Staff Only: item control page