Suppr超能文献

双重切割和连接基因组进化过程的简约性逃避。

Escape from Parsimony of a Double-Cut-and-Join Genome Evolution Process.

机构信息

Department of Mathematics and Statistics, University of Ottawa, Ottawa, Canada.

Department of Mathematics, Columbia University, New York, New York, USA.

出版信息

J Comput Biol. 2023 Feb;30(2):118-130. doi: 10.1089/cmb.2021.0468. Epub 2023 Jan 2.

Abstract

We analyze models of genome evolution based on both restricted and unrestricted double-cut-and-join (DCJ) operations. Not only do our models allow different types of operations generated by DCJs (including reversals, translocations, transpositions, fissions, and fusions) to take different weights during the course of evolution, but they also let these weights fluctuate over time. We compare the number of operations along the evolutionary trajectory with the DCJ distance of the genome from its ancestor at each step, and determine at what point they diverge: the process escapes from parsimony. Adapting the method developed by Berestycki and Durrett, we approximate the number of cycles in the breakpoint graph of a random genome at time and its ancestral genome by the number of tree components in a random graph (not necessarily an Erdös-Rényi one) constructed from the model of evolution. In both models, the process on a genome of size is bound to its parsimonious estimate up to steps.

摘要

我们基于受限和非受限双切接(DCJ)操作分析了基因组进化模型。我们的模型不仅允许在进化过程中对由 DCJ 产生的不同类型的操作(包括倒位、易位、转座、分裂和融合)赋予不同的权重,而且还允许这些权重随时间波动。我们比较了进化轨迹上的操作数量与每个步骤中基因组与其祖先的 DCJ 距离,并确定了它们何时出现分歧:该过程逃避了简约性。通过采用 Berestycki 和 Durrett 开发的方法,我们通过从进化模型构建的随机图(不一定是 Erdös-Rényi 图)中的树分量数来近似随机基因组在时间 和其祖先基因组的断点图中的循环数。在这两个模型中,大小为 的基因组上的过程在 步内与其简约估计值相关。

文献AI研究员

20分钟写一篇综述,助力文献阅读效率提升50倍。

立即体验

用中文搜PubMed

大模型驱动的PubMed中文搜索引擎

马上搜索

文档翻译

学术文献翻译模型,支持多种主流文档格式。

立即体验