基因组组装问题引发的超图覆盖问题
Hypergraph covering problems motivated by genome assembly questions
摘要:
连续一性质(C1P)是离散数学中的一个经典概念,已被用于从当代基因组的物理映射到古代基因组的组装的几个基因组学应用中。基因组组装中的一个常见问题涉及重复序列,即出现在基因组几个位置的基因组序列。处理重复导致C1P的一个变体,多重C1P(mC1P),也可以看作是用线性和循环遍历覆盖超图的边的问题。在目前的工作中,我们描述的mC1P的变体,解决基因组组装的具体问题,和多项式时间或固定参数的算法来解决这些问题。
英文摘要:
The Consecutive-Ones Property (C1P) is a classical concept in discrete mathematics that has been used in several genomics applications, from physical mapping of contemporary genomes to the assembly of ancient genomes. A common issue in genome assembly concerns repeats, genomic sequences that appear in several locations of a genome. Handling repeats leads to a variant of the C1P, the C1P with multiplicity (mC1P), that can also be seen as the problem of covering edges of hypergraphs by linear and circular walks. In the present work, we describe variants of the mC1P that address specific issues of genome assembly, and polynomial time or fixed-parameter algorithms to solve them.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。