首页> 外文会议>ISBRA 2013 >Reconstructing Ancestral Genomic Orders Using Binary Encoding and Probabilistic Models
【24h】

Reconstructing Ancestral Genomic Orders Using Binary Encoding and Probabilistic Models

机译:使用二进制编码和概率模型重建祖先的基因组命令

获取原文

摘要

Changes of gene ordering under rearrangements have been extensively used as a signal to reconstruct phylogenies and ancestral genomes. Inferring the gene order of an extinct species has the potential in revealing a more detailed evolutionary history of species descended from it. Current tools used in ancestral reconstruction may fall into parsimonious and probabilistic methods according to the criteria they follow. In this study, we propose a new probabilistic method called PMAG to infer the ancestral genomic orders by calculating the conditional probabilities of gene adjacencies using Bayes' theorem. The method incorporates a transition model designed particularly for genomic rearrangement scenarios, a reroot procedure to relocate the root to the target ancestor that is inferred as well as a greedy algorithm to connect adjacencies with high conditional probabilities into valid gene orders.We conducted a series of simulation experiments to assess the performance of PMAG and compared it against previously existing probabilistic methods (InferCARsPro) and parsimonious methods (GRAPPA). As we learned from the results, PMAG can reconstruct more correct ancestral adjacencies and yet run several orders of magnitude faster than InferCARsPro and GRAPPA.
机译:重排下基因排序的变化已被广泛地用作重建文学和祖先基因组的信号。推断出灭绝物种的基因阶具有揭示从中脱落的更详细的进化史的潜力。根据他们遵循的标准,祖先重建中使用的目前的工具可能属于解释和概率的方法。在这项研究中,我们提出了一种新的概率方法,称为PMAG来推断祖先静止使用贝叶斯定理的条件概率来推断祖先的基因组令。该方法包含一个特别设计用于基因组重新排列场景的过渡模型,重新启动root过程将根部重新定位到目标祖先,该目标祖先推断为贪婪算法,以将具有高条件概率的邻接连接到有效的基因订单。我们进行了一系列仿真实验,以评估PMAG的性能,并将其与以前现有的概率方法(普及曲线)和解析方法(GRAPPA)进行比较。正如我们从结果中学到的那样,PMAG可以重建更正确的祖传邻接,但比IlferCarsPro和Grappa更快地运行几个数量级。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号