首页> 外文会议>Annual ACM-SIAM Symposium on Discrete Algorithms >Species Trees from Gene Trees Despite a High Rate of Lateral Genetic Transfer: A Tight Bound
【24h】

Species Trees from Gene Trees Despite a High Rate of Lateral Genetic Transfer: A Tight Bound

机译:尽管横向遗传转移率很高,但仍有高速率的树木

获取原文

摘要

Reconstructing the tree of life from molecular sequences is a fundamental problem in computational biology. Modern data sets often contain a large number of genes which can complicate the reconstruction problem due to the fact that different genes may undergo different evolutionary histories. This is the case in particular in the presence of lateral genetic transfer (LGT), whereby a gene is inherited from a distant species rather than an immediate ancestor. Such an event produces a gene tree which is distinct from (but related to) the species phylogeny. In previous work, a stochastic model of LGT was introduced and it was shown that the species phylogeny can be reconstructed from gene trees despite surprisingly high rates of LGT. Both lower and upper bounds on this rate were obtained, but a large gap remained. Here we close this gap, up to a constant. Specifically, we show that the species phylogeny can be reconstructed perfectly even when each edge of the tree has a constant probability of being the location of an LGT event. Our new reconstruction algorithm builds the tree recursively from the leaves. We also provide a matching bound in the negative direction (up to a constant).
机译:从分子序列重建生命树是计算生物学中的一个基本问题。现代数据集通常包含大量基因,这可能使重建问题复杂化,因为不同的基因可能发生不同的进化历史。这特别是在存在横向遗传转移(LGT)中,其中基因由远处物种而不是直接祖先遗传。这种事件产生了一种与物种系统发生的(但相关)不同的基因树。在以前的工作中,引入了LGT的随机模型,并显示出在LGT的令人惊讶的高速率下,可以从基因树重建物种。获得此速率的下限和上限,但仍然存在大的间隙。在这里,我们关闭了这个差距,直到一个常数。具体地,我们表明,即使树的每个边缘具有作为LGT事件的位置的恒定概率,也可以完美地重建物种系统发育。我们的新重建算法从叶子递归地构建树。我们还提供了在负方向(最多常数)的匹配。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号