THE NEIGHBOR-JOINING METHOD - A NEW METHOD FOR RECONSTRUCTING PHYLOGENETIC TREES
THE NEIGHBOR-JOINING METHOD - A NEW METHOD FOR RECONSTRUCTING PHYLOGENETIC TREES
复制标题
DOI：
10.1093/oxfordjournals.molbev.a040454
复制
发表时间：
1987-07-01
影响因子：
10.7
通讯作者：
NEI, M
中科院分区：
文献类型：
--
作者：
SAITOU, N;NEI, M
提出了一种称为邻接法的新方法，用于从进化距离数据重建系统发育树。该方法的原理是找到操作分类单元（OTU[=邻居]）对，在从星状树开始的OTU聚类的每个阶段使总分支长度最小化。通过使用这种方法，可以快速获得简约树的分支长度以及拓扑结构。通过计算机模拟，我们研究了这种方法与其他五种建树方法（不加权成对群分析方法、法里斯方法、萨塔斯和特沃斯基方法、李方法以及立野等人的改进法里斯方法）相比，在获得正确的无根树方面的效率。结果表明，新的邻接法以及萨塔斯和特沃斯基方法通常优于其他方法。
A new method called the neighbor-joining method is proposed for reconstructing phylogenetic trees from evolutionary distance data. The principle of this method is to find pairs of operational taxonomic units (OTUs [=neighbors]) that minimize the total branch length at each stage of clustering of OTUs starting with a starlike tree. The branch lengths as well as the topology of a parsimonious tree can quickly be obtained by using this 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 Tversky''s method are shown to be generally better than the other methods.