Suppr超能文献

基于最小模型复杂度方法的无根分子系统发育树拓扑结构选择

Topology selection in unrooted molecular phylogenetic tree by minimum model-based complexity method.

作者信息

Tanaka H, Ren F, Okayama T, Gojobori T

机构信息

Tokyo Medical and Dental University, Japan.

出版信息

Pac Symp Biocomput. 1999:326-37. doi: 10.1142/9789814447300_0032.

Abstract

In reconstruction of phylogenetic trees from molecular data, it has been pointed out that multifurcate phylogenetic trees are difficult to be correctly reconstructed by the conventional methods like maximum likelihood method(ML). In order to resolve this problem, we have been engaged in developing a new phylogenetic tree reconstruction method, based on the minimum complexity principle widely used in the inductive inference. Our method, which we call "minimum model-based complexity (MBC) method", has been proved so far to be efficient in estimating multifurcate branching when the tree is described in the form of rooted one. In this study, we make further investigations about the efficiency of MBC method in estimating the multifurcation in unrooted phylogenetic trees. To do so, we conduct computer simulation in which the estimations by MBC method are compared with those by ML, AIC and statistical test approach. The results show that MBC method also provides good estimations even in the case of multifurcate unrooted trees and suggest that it could be generally used for reconstruction of phylogenetic tree having arbitrary multifurcations.

摘要

在从分子数据重建系统发育树时,有人指出,多歧系统发育树很难用诸如最大似然法(ML)等传统方法正确重建。为了解决这个问题,我们一直在致力于开发一种新的系统发育树重建方法,该方法基于归纳推理中广泛使用的最小复杂性原则。我们的方法,我们称之为“基于最小模型的复杂性(MBC)方法”,到目前为止,当树以有根树的形式描述时,已被证明在估计多歧分支方面是有效的。在本研究中,我们进一步研究了MBC方法在估计无根系统发育树中的多歧性方面的效率。为此,我们进行了计算机模拟,将MBC方法的估计结果与ML、AIC和统计检验方法的估计结果进行比较。结果表明,即使在多歧无根树的情况下,MBC方法也能提供良好的估计结果,这表明它可以普遍用于重建具有任意多歧性的系统发育树。

文献检索

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

立即免费搜索

文件翻译

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

免费翻译文档

深度研究

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

立即免费体验