Suppr超能文献

最大简约法和距离矩阵法在获得正确系统发育树方面的相对效率。

Relative efficiencies of the maximum parsimony and distance-matrix methods in obtaining the correct phylogenetic tree.

作者信息

Sourdis J, Nei M

机构信息

Center for Demographic and Population Genetics, University of Texas Health Science Center, Houston 77225.

出版信息

Mol Biol Evol. 1988 May;5(3):298-311. doi: 10.1093/oxfordjournals.molbev.a040497.

Abstract

The relative efficiencies of the maximum parsimony (MP) and distance-matrix methods in obtaining the correct tree (topology) were studied by using computer simulation. The distance-matrix methods examined are the neighbor-joining, distance-Wagner, Tateno et al. modified Farris, Faith, and Li methods. In the computer simulation, six or eight DNA sequences were assumed to evolve following a given model tree, and the evolutionary changes of the sequences were followed. Both constant and varying rates of nucleotide substitution were considered. From the sequences thus obtained, phylogenetic trees were constructed using the six tree-making methods and compared with the model (true) tree. This process was repeated 300 times for each different set of parameters. The results obtained indicate that when the number of nucleotide substitutions per site is small and a relatively small number of nucleotides are used, the probability of obtaining the correct topology (P1) is generally lower in the MP method than in the distance-matrix methods. The P1 value for the MP method increases with increasing number of nucleotides but is still generally lower than the value for the NJ or DW method. Essentially the same conclusion was obtained whether or not the rate of nucleotide substitution was constant or whether or not a transition bias in nucleotide substitution existed. The relatively poor performance of the MP method for these cases is due to the fact that information from singular sites is not used in this method. The MP method also showed a relatively low P1 value when the model of varying rate of nucleotide substitution was used and the number of substitutions per site was large. However, the MP method often produced cases in which the correct tree was one of several equally parsimonious trees. When these cases were included in the class of "success," the MP method performed better than the other methods, provided that the number of nucleotide substitutions per site was small.

摘要

通过计算机模拟研究了最大简约法(MP)和距离矩阵法在获得正确树(拓扑结构)方面的相对效率。所研究的距离矩阵法包括邻接法、距离 Wagner 法、Tateno 等人改进的 Farris 法、Faith 法和 Li 法。在计算机模拟中,假定六个或八个 DNA 序列按照给定的模型树进行进化,并追踪序列的进化变化。同时考虑了核苷酸替换的恒定速率和变化速率。从这样获得的序列中,使用六种建树方法构建系统发育树,并与模型(真实)树进行比较。对于每组不同的参数,此过程重复 300 次。所得结果表明,当每个位点的核苷酸替换数较少且使用的核苷酸数量相对较少时,MP 法获得正确拓扑结构的概率(P1)通常低于距离矩阵法。MP 法的 P1 值随核苷酸数量的增加而增加,但通常仍低于 NJ 法或 DW 法的值。无论核苷酸替换速率是否恒定,也无论核苷酸替换中是否存在转换偏差,都得出了基本相同的结论。在这些情况下,MP 法表现相对较差是因为该方法未使用来自奇异位点的信息。当使用核苷酸替换速率变化的模型且每个位点的替换数较大时,MP 法也显示出相对较低的 P1 值。然而,MP 法经常产生这样的情况,即正确的树是几个同样简约的树之一。当将这些情况归入“成功”类别时,如果每个位点的核苷酸替换数较少,MP 法的表现优于其他方法。

文献AI研究员

20分钟写一篇综述,助力文献阅读效率提升50倍。

立即体验

用中文搜PubMed

大模型驱动的PubMed中文搜索引擎

马上搜索

文档翻译

学术文献翻译模型,支持多种主流文档格式。

立即体验