序列到图对齐的复杂性与共线性链
Complexity of Sequence-to-Graph Alignment with Co-Linear Chaining
AI总结:
本文研究了序列到图对齐中共线性链问题的计算复杂性,证明了其在亚二次时间内的求解难度及NP难性,揭示了共线性结构对计算复杂性无实质影响。
摘要:
序列对齐是计算生物学中用于评估生物序列相似性和差异性的核心技术。一个关键变种,序列到图对齐,在有效捕捉遗传变异方面起着关键作用。在本文中,我们在此框架内引入了两个新的公式:Gap-sensitive Co-Linear Chaining(Gap-CLC)问题和基于编辑距离的Co-Linear Chaining with Errors(Edit-CLC)问题,并研究了它们的计算复杂性。我们证明,除非Strong Exponential Time Hypothesis失效,否则在亚二次时间内解决Gap-CLC问题是高度不可能的——即使在二元字母表限制下。此外,我们确立了在泛基因组图中存在错误的情况下,Edit-CLC问题是NP难的。这些发现强调,将共线性结构纳入序列到图对齐模型中无法降低计算复杂性,突出这些模型至少与没有此类先验信息的模型一样具有计算挑战性。
英文摘要:
Sequence alignment is a cornerstone technique in computational biology for assessing similarities and differences among biological sequences. A key variant, sequence-to-graph alignment, plays a crucial role in effectively capturing genetic variations. In this work, we introduce two novel formulations within this framework: the Gap-sensitive Co-Linear Chaining (Gap-CLC) problem and the Co-Linear Chaining with Errors based on Edit Distance (Edit-CLC) problem, and we investigate their computational complexity. We show that solving the Gap-CLC problem in sub-quadratic time is highly unlikely unless the Strong Exponential Time Hypothesis fails -- even when restricted to binary alphabets. Furthermore, we establish that the Edit-CLC problem is NP-hard in the presence of errors within the pan-genome graph. These findings emphasize that incorporating co-linear structures into sequence-to-graph alignment models fails to reduce computational complexity, highlighting that these models remain at least as computationally challenging to solve as those lacking such prior information.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。