Suppr超能文献

邻接法使用净分歧的最优权重。

Neighbor-joining uses the optimal weight for net divergence.

作者信息

Charleston M A, Hendy M D, Penny D

机构信息

Department of Mathematics, Massey University, Palmerston North, New Zealand.

出版信息

Mol Phylogenet Evol. 1993 Mar;2(1):6-12. 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.

摘要

定义了一类系统发育聚类方法,这类方法根据距离数据计算净分歧,但对净分歧赋予不同的权重。该类别包括邻接法和算术平均非加权对组法。通过计算机模拟研究了其中一些方法在加法树假设下四个分类单元的情况的准确性。在这些方法以及该假设下,证明了邻接法对净分歧使用的是唯一一致的权重,因此它是该类别中唯一预期随着添加更多数据而收敛到正确树的方法。然后通过模拟将邻接法与五个分类单元的距离最近树进行比较。证明了距离最近树对于四个分类单元等同于邻接法,但在考虑超过四个分类单元时则不然。

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验