arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1909.12877cs.DS
收藏

计算Inversion-Indel距离

Computing the Inversion-Indel Distance

Eyla Willing, Jens Stoye, Marília D. V. Braga

摘要:

倒位距离,即两个具有相同内容的单染色体基因组之间的距离,仅允许DNA片段的倒位,可以精确计算,这要归功于Hannenhalli和Pevzner从1995年开始的开创性方法。2000年,El-Mabrouk扩展了倒置模型,将倒置与DNA片段的插入和缺失(indel)相结合,进行了具有不等含量的单染色体基因组的比较,产生了倒置-indel距离。然而,只有一个启发式的计算提供。在2005年,Yancopoulos,Attie和Friedberg通过引入通用的双重切割和连接(DCJ)操作开始了一个新的研究分支,该操作可以代表几种基因组重排(包括倒位)。在2006年,Bergeron、Mixtacki和Stoye证明了DCJ距离可以用一个非常简单的程序在线性时间内计算。因此,在2010年,我们给出了一个线性时间算法来计算DCJ-indel距离。这一结果使得我们可以从另一个角度重新审视反转-插入-缺失模型。在2013年,我们可以证明,当表示两个比较基因组之间关系的图没有坏组件时,inversion-indel距离等于DCJ-indel距离。在目前的工作中,我们完成了研究的反转indel距离,给出了第一个算法来计算它,甚至在坏组件的存在。

英文摘要:

The inversion distance, that is the distance between two unichromosomal genomes with the same content allowing only inversions of DNA segments, can be exactly computed thanks to a pioneering approach of Hannenhalli and Pevzner from 1995. In 2000, El-Mabrouk extended the inversion model to perform the comparison of unichromosomal genomes with unequal contents, combining inversions with insertions and deletions (indels) of DNA segments, giving rise to the inversion-indel distance. However, only a heuristic was provided for its computation. In 2005, Yancopoulos, Attie and Friedberg started a new branch of research by introducing the generic double cut and join (DCJ) operation, that can represent several genome rearrangements (including inversions). In 2006, Bergeron, Mixtacki and Stoye showed that the DCJ distance can be computed in linear time with a very simple procedure. As a consequence, in 2010 we gave a linear-time algorithm to compute the DCJ-indel distance. This result allowed the inversion-indel model to be revisited from another angle. In 2013, we could show that, when the diagram that represents the relation between the two compared genomes has no bad components, the inversion-indel distance is equal to the DCJ-indel distance. In the present work we complete the study of the inversion-indel distance by giving the first algorithm to compute it exactly even in the presence of bad components.

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

↑