首页> 美国卫生研究院文献>Proceedings of the Royal Society B: Biological Sciences >Uncertain-tree: discriminating among competing approaches to the phylogenetic analysis of phenotype data
【2h】

Uncertain-tree: discriminating among competing approaches to the phylogenetic analysis of phenotype data

机译:不确定树:区分表型数据系统发育分析的竞争方法

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Morphological data provide the only means of classifying the majority of life's history, but the choice between competing phylogenetic methods for the analysis of morphology is unclear. Traditionally, parsimony methods have been favoured but recent studies have shown that these approaches are less accurate than the Bayesian implementation of the Mk model. Here we expand on these findings in several ways: we assess the impact of tree shape and maximum-likelihood estimation using the Mk model, as well as analysing data composed of both binary and multistate characters. We find that all methods struggle to correctly resolve deep clades within asymmetric trees, and when analysing small character matrices. The Bayesian Mk model is the most accurate method for estimating topology, but with lower resolution than other methods. Equal weights parsimony is more accurate than implied weights parsimony, and maximum-likelihood estimation using the Mk model is the least accurate method. We conclude that the Bayesian implementation of the Mk model should be the default method for phylogenetic estimation from phenotype datasets, and we explore the implications of our simulations in reanalysing several empirical morphological character matrices. A consequence of our finding is that high levels of resolution or the ability to classify species or groups with much confidence should not be expected when using small datasets. It is now necessary to depart from the traditional parsimony paradigms of constructing character matrices, towards datasets constructed explicitly for Bayesian methods.
机译:形态学数据提供了对生命的大部分历史进行分类的唯一方法,但是尚不清楚在竞争性系统发育方法之间进行形态分析的选择。传统上,简约方法一直受到青睐,但是最近的研究表明,这些方法比Mk模型的贝叶斯实现更不准确。在这里,我们以几种方式扩展这些发现:我们使用Mk模型评估树形和最大似然估计的影响,以及分析由二进制和多状态字符组成的数据。我们发现,在分析小字符矩阵时,所有方法都难以正确解析不对称树中的深层分支。贝叶斯Mk模型是最准确的拓扑估计方法,但分辨率比其他方法低。等权重简约性比隐含权重简约性更准确,使用Mk模型的最大似然估计是最不准确的方法。我们得出结论,Mk模型的贝叶斯实现应该是从表型数据集进行系统发育估计的默认方法,并且我们探索了我们的模拟在重新分析几种经验形态特征矩阵中的意义。我们发现的结果是,在使用小型数据集时,不应期望具有很高的分辨率或具有很高的信心对物种或群体进行分类的能力。现在有必要脱离构造字符矩阵的传统简约范式,转向为贝叶斯方法显式构造的数据集。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号