覆盖比对的困难性:后序列基因组学中的相变
Hardness of Covering Alignment: Phase Transition in Post-Sequence Genomics
摘要:
覆盖比对问题源于基因组学的最新发展;所谓的泛基因组图正在取代参考基因组,单体型分析的进展使二倍体基因组的全部内容能够用作序列分析的基础。在本文中,我们表明,计算复杂性将改变自然延伸的泛基因组表示和二倍体基因组的对齐。更广泛地说,我们的方法也可以被看作是一个最小的扩展序列比对标记有向无环图(标记DAG)。也就是说,我们发现一个\emph{covering alignment}的两个标记的DAG是NP难的,即使在二进制字母。覆盖比对要求DAG $D_1$中的两条路径$R_1$(红色)和$G_1$(绿色)以及DAG $D_2$中的两条路径$R_2$(红色)和$G_2$(绿色),它们覆盖图的节点并最大化全局比对得分之和:$\mathsf{as}(\mathsf{sp}(R_1),\mathsf{sp}(R_2))+\mathsf{as}(\mathsf{sp}(G_1),\mathsf{sp}(G_2))$,其中$\mathsf{sp}(P)$是路径$P$上标签的级联。形成二倍体染色体的单倍型序列的成对比对可以转换为双路径可覆盖标记的DAG,然后覆盖比对模拟两个二倍体在任意重组上的相似性。我们还减少到另一个方向,显示这样的重组遗忘二倍体对齐是NP难的大小$3$的字母表。
英文摘要:
Covering alignment problems arise from recent developments in genomics; so called pan-genome graphs are replacing reference genomes, and advances in haplotyping enable full content of diploid genomes to be used as basis of sequence analysis. In this paper, we show that the computational complexity will change for natural extensions of alignments to pan-genome representations and to diploid genomes. More broadly, our approach can also be seen as a minimal extension of sequence alignment to labelled directed acyclic graphs (labeled DAGs). Namely, we show that finding a \emph{covering alignment} of two labeled DAGs is NP-hard even on binary alphabets. A covering alignment asks for two paths $R_1$ (red) and $G_1$ (green) in DAG $D_1$ and two paths $R_2$ (red) and $G_2$ (green) in DAG $D_2$ that cover the nodes of the graphs and maximize the sum of the global alignment scores: $\mathsf{as}(\mathsf{sp}(R_1),\mathsf{sp}(R_2))+\mathsf{as}(\mathsf{sp}(G_1),\mathsf{sp}(G_2))$, where $\mathsf{sp}(P)$ is the concatenation of labels on the path $P$. Pair-wise alignment of haplotype sequences forming a diploid chromosome can be converted to a two-path coverable labelled DAG, and then the covering alignment models the similarity of two diploids over arbitrary recombinations. We also give a reduction to the other direction, to show that such a recombination-oblivious diploid alignment is NP-hard on alphabets of size $3$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。