首页> 美国卫生研究院文献>Bioinformatics >An algorithm for computing the gene tree probability under the multispecies coalescent and its application in the inference of population tree
【2h】

An algorithm for computing the gene tree probability under the multispecies coalescent and its application in the inference of population tree

机译:多物种合并下的基因树概率计算算法及其在种群树推断中的应用

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

摘要

>Motivation: Gene tree represents the evolutionary history of gene lineages that originate from multiple related populations. Under the multispecies coalescent model, lineages may coalesce outside the species (population) boundary. Given a species tree (with branch lengths), the gene tree probability is the probability of observing a specific gene tree topology under the multispecies coalescent model. There are two existing algorithms for computing the exact gene tree probability. The first algorithm is due to Degnan and Salter, where they enumerate all the so-called coalescent histories for the given species tree and the gene tree topology. Their algorithm runs in exponential time in the number of gene lineages in general. The second algorithm is the STELLS algorithm (2012), which is usually faster but also runs in exponential time in almost all the cases.>Results: In this article, we present a new algorithm, called CompactCH, for computing the exact gene tree probability. This new algorithm is based on the notion of compact coalescent histories: multiple coalescent histories are represented by a single compact coalescent history. The key advantage of our new algorithm is that it runs in polynomial time in the number of gene lineages if the number of populations is fixed to be a constant. The new algorithm is more efficient than the STELLS algorithm both in theory and in practice when the number of populations is small and there are multiple gene lineages from each population. As an application, we show that CompactCH can be applied in the inference of population tree (i.e. the population divergence history) from population haplotypes. Simulation results show that the CompactCH algorithm enables efficient and accurate inference of population trees with much more haplotypes than a previous approach.>Availability: The CompactCH algorithm is implemented in the STELLS software package, which is available for download at .>Contact: >Supplementary information: are available at Bioinformatics online.
机译:>动机:基因树代表了起源于多个相关种群的基因谱系的进化历史。在多物种合并模型下,谱系可以在物种(种群)边界之外合并。给定一个物种树(具有分支长度),基因树概率是在多物种合并模型下观察特定基因树拓扑的概率。现有两种用于计算确切基因树概率的算法。第一个算法归功于Degnan和Salter,他们列举了给定物种树和基因树拓扑的所有所谓的合并历史。他们的算法通常在基因谱系数量上以指数时间运行。第二种算法是STELLS算法(2012年),通常速度更快,但几乎在所有情况下都以指数时间运行。>结果:在本文中,我们提出了一种新算法,称为CompactCH,用于计算确切的基因树概率。此新算法基于紧凑合并历史的概念:多个合并历史由单个紧凑合并历史表示。我们的新算法的主要优势在于,如果种群数量固定为常数,那么它将在多项式时间内以基因谱系的数量运行。当种群数量少并且每个种群有多个基因谱系时,新算法在理论上和实践上都比STELLS算法更有效。作为应用,我们表明CompactCH可以用于根据人口单倍型推断人口树(即人口分歧历史)。仿真结果表明,与以前的方法相比,CompactCH算法可以有效,准确地推断具有更多单倍型的种群树。>可用性: CompactCH算法在STELLS软件包中实现,可以从以下位置下载。>联系方式: >补充信息:可从在线生物信息学获得。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号