从子串重建多条序列的基本极限
Fundamental Limits of Multiple Sequence Reconstruction from Substrings
AI总结:
本文研究从多条序列的k-mer集合并集中同时重建序列的基本极限,刻画了渐近可行区域,并指出在重复频繁时需非平凡算法才能达到该极限。
摘要:
从长度为$k$的子串集合重建序列的问题,因其在基因组学中的多种应用而受到广泛关注。我们研究该问题的一个无编码版本,其中多个随机信源需要从它们的$k$-mer集合的并集中同时重建。我们考虑一个渐近情形:$m = n^\alpha$条长度为$n$的独立同分布信源序列,需要从它们长度为$k=\beta\log n$的子串集合中重建,并试图刻画重建在信息论上可行的$(\alpha,\beta)$对。我们证明,当$n \to \infty$时,若$\beta> \max(2\alpha+1,\alpha+2)$,则信源序列可以被重建;若$\beta< \max( 2\alpha+1, \alpha+ \tfrac32)$,则无法重建,从而几乎完全刻画了可行性区域。有趣的是,我们的结果表明,存在可行的$(\alpha,\beta)$对,其中跨信源字符串的重复频繁出现,需要非平凡的重建算法才能达到基本极限。
英文摘要:
The problem of reconstructing a sequence from the set of its length-$k$ substrings has received considerable attention due to its various applications in genomics. We study an uncoded version of this problem where multiple random sources are to be simultaneously reconstructed from the union of their $k$-mer sets. We consider an asymptotic regime where $m = n^α$ i.i.d. source sequences of length $n$ are to be reconstructed from the set of their substrings of length $k=β\log n$, and seek to characterize the $(α,β)$ pairs for which reconstruction is information-theoretically feasible. We show that, as $n \to \infty$, the source sequences can be reconstructed if $β> \max(2α+1,α+2)$ and cannot be reconstructed if $β< \max( 2α+1, α+ \tfrac32)$, characterizing the feasibility region almost completely. Interestingly, our result shows that there are feasible $(α,β)$ pairs where repeats across the source strings abound, and non-trivial reconstruction algorithms are needed to achieve the fundamental limit.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。