...
首页> 外文期刊>Cladistics: The international journal of the Willi Hennig Society >Problems with supertrees based on the subtree prune-and-regraft distance, with comments on majority rule supertrees
【24h】

Problems with supertrees based on the subtree prune-and-regraft distance, with comments on majority rule supertrees

机译:基于子树修剪和嫁接距离的超级树问题,并附有多数规则超级树的注释

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

获取外文期刊封面封底 >>

       

摘要

This paper examines a recent proposal to calculate supertrees by minimizing the sum of subtree prune-and-regraft distances to the input trees. The supertrees thus calculated may display groups present in a minority of the input trees but contradicted by the majority, or groups that are not supported by any input tree or combination of input trees. The proponents of the method themselves stated that these are serious problems of "matrix representation with parsimony", but they can in fact occur in their own method. The majority rule supertrees, being explicitly clade-based, cannot have these problems, and seem much more suited to retrieving common clades from a set of trees with different taxon sets. However, it is dubious that so-called majority rule supertrees can always be interpreted as displaying those clades present (or compatible with) with a majority of the trees. The majority rule consensus is always a median tree, in terms of the Robinson-Foulds distances (i.e. it minimizes the sum of Robinson-Foulds distances to the input trees). In contrast, majority rule supertrees may not be median-different, contradictory trees may minimize Robinson-Foulds distances, while their strict consensus does not. If being "majority" results from being median in Robinson-Foulds distances, this means that in the supertree setting a "majority" is ambiguously defined, sometimes achievable only by mutually contradictory trees. (C) The Willi Hennig Society 2015.
机译:本文研究了一种最近的提议,即通过最小化子树到输入树的修剪和嫁接距离之和来计算超树。如此计算的超树可以显示出现在少数输入树中但与大多数矛盾的组,或者任何输入树或输入树组合不支持的组。该方法的支持者自己说,这些都是“用简约的矩阵表示”的严重问题,但实际上它们可以用自己的方法发生。多数规则的超树是明确基于进化枝的,不会出现这些问题,并且似乎更适合于从具有不同分类群的一组树中检索常见进化枝。然而,可以怀疑的是,所谓多数多数规则超级树总是可以解释为显示那些与多数树木存在(或兼容)的进化枝。就鲁滨逊-富尔兹距离而言,多数规则共识始终是一棵中位数树(即,它使到输入树的鲁滨逊-富尔兹距离之和最小化)。相反,多数规则超树可能不是中位数差异的,相反的树可能会最小化Robinson-Foulds距离,而严格的共识则不会。如果“多数”是由Robinson-Foulds距离的中位数导致的,则意味着在超级树设置中,“多数”是模棱两可的,有时只能通过相互矛盾的树来实现。 (C)威利·亨尼格学会2015年。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号