Suppr超能文献

基于分子数据的系统发育树估计的准确性。I. 远缘物种

Accuracy of estimated phylogenetic trees from molecular data. I. Distantly related species.

作者信息

Tateno Y, Nei M, Tajima F

出版信息

J Mol Evol. 1982;18(6):387-404. doi: 10.1007/BF01840887.

Abstract

The accuracies and efficiencies of four different methods for constructing phylogenetic trees from molecular data were examined by using computer simulation. The methods examined are UPGMA, Fitch and Margoliash's (1967) (F/M) method, Farris' (1972) method, and the modified Farris method (Tateno, Nei, and Tajima, this paper). In the computer simulation, eight OTUs (32 OTUs in one case) were assumed to evolve according to a given model tree, and the evolutionary change of a sequence of 300 nucleotides was followed. The nucleotide substitution in this sequence was assumed to occur following the Poisson distribution, negative binomial distribution or a model of temporally varying rate. Estimates of nucleotide substitutions (genetic distances) were then computed for all pairs of the nucleotide sequences that were generated at the end of the evolution considered, and from these estimates a phylogenetic tree was reconstructed and compared with the true model tree. The results of this comparison indicate that when the coefficient of variation of branch length is large the Farris and modified Farris methods tend to be better than UPGMA and the F/M method for obtaining a good topology. For estimating the number of nucleotide substitutions for each branch of the tree, however, the modified Farris method shows a better performance than the Farris method. When the coefficient of variation of branch length is small, however, UPGMA shows the best performance among the four methods examined. Nevertheless, any tree-making method is likely to make errors in obtaining the correct topology with a high probability, unless all branch lengths of the true tree are sufficiently long. It is also shown that the agreement between patristic and observed genetic distances is not a good indicator of the goodness of the tree obtained.

摘要

通过计算机模拟检验了从分子数据构建系统发育树的四种不同方法的准确性和效率。所检验的方法有UPGMA法、菲奇和马戈利亚什(1967年)(F/M)法、法里斯(1972年)法以及改良的法里斯法(立野、内村和田岛,本文)。在计算机模拟中,假定八个OTU(在一种情况下为32个OTU)按照给定的模型树进化,并追踪300个核苷酸序列的进化变化。假定该序列中的核苷酸替换按照泊松分布、负二项分布或时变速率模型发生。然后计算在考虑的进化结束时生成的所有核苷酸序列对之间的核苷酸替换估计值(遗传距离),并根据这些估计值重建系统发育树,并与真实的模型树进行比较。这种比较的结果表明,当分支长度的变异系数较大时,法里斯法和改良的法里斯法在获得良好拓扑结构方面往往比UPGMA法和F/M法更好。然而,对于估计树的每个分支的核苷酸替换数,改良的法里斯法比法里斯法表现更好。然而,当分支长度的变异系数较小时,UPGMA法在所检验的四种方法中表现最佳。尽管如此,除非真实树的所有分支长度都足够长,否则任何建树方法都很可能在获得正确拓扑结构时出现错误。还表明,祖先遗传距离与观察到的遗传距离之间的一致性并不是所获得树质量的良好指标。

文献检索

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

立即免费搜索

文件翻译

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

免费翻译文档

深度研究

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

立即免费体验