系统发育树
树(集合论)
生物
聚类分析
系统发育网络
树重组
计算系统发育学
算法
数学
计算机科学
组合数学
人工智能
基因
遗传学
标识
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.
科研通智能强力驱动
Strongly Powered by AbleSci AI