首页> 美国卫生研究院文献>BMC Bioinformatics >A fast method for calculating reliable event supports in tree reconciliations via Pareto optimality
【2h】

A fast method for calculating reliable event supports in tree reconciliations via Pareto optimality

机译:通过帕累托最优计算树协调中可靠事件支持的快速方法

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

摘要

BackgroundGiven a gene and a species tree, reconciliation methods attempt to retrieve the macro-evolutionary events that best explain the discrepancies between the two tree topologies. The DTL parsimonious approach searches for a most parsimonious reconciliation between a gene tree and a (dated) species tree, considering four possible macro-evolutionary events (speciation, duplication, transfer, and loss) with specific costs. Unfortunately, many events are erroneously predicted due to errors in the input trees, inappropriate input cost values or because of the existence of several equally parsimonious scenarios. It is thus crucial to provide a measure of the reliability for predicted events. It has been recently proposed that the reliability of an event can be estimated via its frequency in the set of most parsimonious reconciliations obtained using a variety of reasonable input cost vectors. To compute such a support, a straightforward but time-consuming approach is to generate the costs slightly departing from the original ones, independently compute the set of all most parsimonious reconciliations for each vector, and combine these sets a posteriori. Another proposed approach uses Pareto-optimality to partition cost values into regions which induce reconciliations with the same number of DTL events. The support of an event is then defined as its frequency in the set of regions. However, often, the number of regions is not large enough to provide reliable supports.
机译:背景技术鉴于基因和物种树,和解方法试图检索最能解释两种树拓扑之间差异的宏观进化事件。 DTL简约方法在基因树和(日期)物种树之间寻找最简约的对帐,同时考虑了四个可能的宏观进化事件(物种形成,复制,转移和损失),并付出了特定的代价。不幸的是,由于输入树中的错误,不适当的输入成本值或由于存在几个同样简约的场景,所以错误地预测了许多事件。因此,至关重要的是提供一种预测事件的可靠性度量。最近已经提出,可以通过使用各种合理的输入成本向量获得的最简约对帐集中的事件的频率来估计事件的可靠性。为了计算这样的支持,一种直接但费时的方法是生成与原始成本略有出入的成本,为每个向量独立计算所有最简约对帐的集合,并将这些集合组合为后验。另一种建议的方法是使用帕累托最优性将成本值划分为多个区域,这些区域会以相同数量的DTL事件引发对帐。然后将事件的支持定义为其在区域集中的频率。但是,通常区域的数量不足以提供可靠的支持。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号