【24h】

Recontructing molecular phylogenetic tree with multifurcation by using minimum complexity principle

机译:用最小复杂度原理重建多分支的分子系统树

获取原文

摘要

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 these years, we have been engaged in developing a new method based on the minimum complexity principle widely used in the inductive inference, which we call minimum model-based complexity (MBC) method. This method has been proved to be efficient in estimating multifurcate rooted tree so far, but in the case of unrooted tree, it appeared to be biased to multifurcate topology. In this study, we make further investigations about MBC method in estimating the multifurcate unrooted tree by using computer simulation and statistical test approach. The results show that, if we take into account the model misspecification effects, the MBC method provides good estimations also in the case of multifurcate unrooted tree and suggest that it could be generally used for reconstructing molecular phylogenetic tree with multifurcation.
机译:在从分子数据重建系统树的过程中,已经指出,很难通过诸如最大似然法(ML)的常规方法正确地重建多叉系统树。近年来,我们一直致力于基于归纳推理中广泛使用的最小复杂度原理开发一种新方法,我们将其称为基于模型的最小复杂度(MBC)方法。到目前为止,已经证明了该方法对于估计多叉根树是有效的,但是在无根树的情况下,它似乎偏向多叉拓扑。在这项研究中,我们将通过计算机仿真和统计测试方法对MBC方法在多叉无根树的估计中进行进一步的研究。结果表明,如果考虑模型错误指定的影响,MBC方法在多分支无根树的情况下也能提供良好的估计,并建议将其普遍用于具有多分支的分子系统发育树的重建。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号