Saitou N, Nei M
Center for Demographic and Population Genetics, University of Texas Health Science Center, Houston 77225.
Mol Biol Evol. 1987 Jul;4(4):406-25. doi: 10.1093/oxfordjournals.molbev.a040454.
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.
提出了一种名为邻接法的新方法，用于从进化距离数据重建系统发育树。该方法的原理是在从星状树开始的操作分类单元（OTU，即邻居）聚类的每个阶段，找到能使总分支长度最小的OTU对。通过使用此方法，可以快速获得简约树的分支长度和拓扑结构。我们通过计算机模拟研究了该方法与其他五种建树方法相比，在获得正确无根树方面的效率，这五种方法分别是：非加权配对组分析方法、法里斯方法、萨塔斯和特沃斯基方法、李方法以及立野等人改进的法里斯方法。结果表明，新的邻接法和萨塔斯与特沃斯基方法通常比其他方法更好。
