首页> 外文期刊>Cladistics: The international journal of the Willi Hennig Society >Parsimony analysis of unaligned sequence data: maximization of homology and minimization of homoplasy, not minimization of operationally defined total cost or minimization of equally weighted transformations
【24h】

Parsimony analysis of unaligned sequence data: maximization of homology and minimization of homoplasy, not minimization of operationally defined total cost or minimization of equally weighted transformations

机译:简化序列数据的简约分析:最大化同源性和最小化同源性,而不是最小化可操作定义的总成本或最小化相等加权的转化

获取原文
获取原文并翻译 | 示例
           

摘要

Wheeler (2012) stated that minimization of ad hoc hypotheses as emphasized by Farris (1983) always leads to a preference for trivial optimizations when analysing unaligned sequence data, leaving no basis for tree choice. That is not correct. Farris's framework can be expressed as maximization of homology, a formulation that has been used to overcome the problems with in-applicables (it leads to the notion of subcharacters as a quantity to be co-minimized in parsimony analysis) and that is known not to lead to a preference for trivial optimizations when analysing unaligned sequence data. Maximization of homology, in turn, can be formulated as a minimization of ad hoc hypotheses of homoplasy in the sense of Farris, as shown here. These issues are not just theoretical but have empirical relevance, It is therefore also discussed how maximization of homology can be approximated under various weighting schemes in heuristic tree alignment programs, such as POY, that do not take into account subcharacters. Empirical analyses that use the so-called 3221 cost set (gap opening cost three, transversion and transition costs two, and gap extension cost one), the cost set that is known to be an optimal approximation under equally weighted homology in POY, are briefly reviewed. From a theoretical point of view, maximization of homology provides the general framework to understand such cost sets in terms that are biologically relevant and meaningful. Whether or not embedded in a sensitivity analysis, this is not the case for minimization of a cost that is defined in operational terms only. Neither is it the case for minimization of equally weighted transformations, a known problem that is not addressed by Kluge and Grant's (2006) proposal to invoke the anti-superfluity principle as a rationale for this minimization. (C) The Willi Hennig Society 2014.
机译:Wheeler(2012)指出,Farris(1983)强调的即席假设的最小化总是导致在分析未比对序列数据时偏向于琐碎的优化,而没有树的选择依据。那是不对的。 Farris的框架可以表示为同源性的最大化,这种表达已被用来克服不适用项的问题(它导致子字符的概念是在简约分析中要共同最小化的量),并且众所周知,在分析未比对的序列数据时,会优先考虑进行简单的优化。反过来,可以将同源性最大化表示为Farris意义上的对同质性的特殊假设的最小化,如此处所示。这些问题不仅是理论上的,而且还具有经验上的相关性,因此,还讨论了如何在启发式树对齐程序(例如POY)的各种加权方案下,不考虑子字符的情况下,近似同源性。简要地讲,使用了所谓的3221成本集(缺口开放成本为三,转换和过渡成本为两,缺口延伸成本为一)进行的经验分析,该成本集是在POY中相等加权同质下的最优近似值。已审查。从理论上讲,同源性的最大化提供了从生物学上相关且有意义的角度理解此类成本集的一般框架。无论是否嵌入敏感性分析中,都不能将仅在运营方面定义的成本降至最低。最小化相等加权的转换也不是这种情况,Kluge和Grant(2006)的提案并未援引反超额度原则作为这种最小化的理由,但这个已知问题并未解决。 (C)2014年威利·亨尼格学会(Willi Hennig Society)。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号