arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1503.05292q-bio.QMq-bio.PE
收藏

从调和遗传学评估基因邻域的简约预测的鲁棒性

Assessing the robustness of parsimonious predictions for gene neighborhoods from reconciled phylogenies

Ashok Rajaraman, Cedric Chauve, Yann Ponty

摘要:

大量组装基因组的可用性开辟了研究系统发育背景下同线性状进化的途径。最近由B {é} rard等人引入的DeCo算法允许从成对的调和基因树计算基因邻接的简约进化场景。遵循由Sturmfels和Pachter开创的方法,我们描述了如何修改的DeCo动态规划算法,以确定类的成本计划,产生类似的吝啬的进化方案的基因邻接,以及鲁棒性的变化的成本计划的进化事件的存在或不存在的特定祖先基因邻接。我们将我们的方法应用到六千哺乳动物基因家族,并表明计算成本方案的变化的鲁棒性提供了新的和有趣的见解基因邻接和DeCo模型的演变。

英文摘要:

The availability of a large number of assembled genomes opens the way to study the evolution of syntenic character within a phylogenetic context. The DeCo algorithm, recently introduced by B{é}rard et al. allows the computation of parsimonious evolutionary scenarios for gene adjacencies, from pairs of reconciled gene trees. Following the approach pioneered by Sturmfels and Pachter, we describe how to modify the DeCo dynamic programming algorithm to identify classes of cost schemes that generates similar parsimonious evolutionary scenarios for gene adjacencies, as well as the robustness to changes to the cost scheme of evolutionary events of the presence or absence of specific ancestral gene adjacencies. We apply our method to six thousands mammalian gene families, and show that computing the robustness to changes to cost schemes provides new and interesting insights on the evolution of gene adjacencies and the DeCo model.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑