从子串进行广义唯一重构
Generalized Unique Reconstruction from Substrings
AI总结:
面向 DNA 存储与测序,本文研究从带最小重叠的连续子串及多字符串子串中唯一重构的问题,给出速率界并构造渐近最优的重构码。
摘要:
本文介绍了一个新的重构码族,其动机来自 DNA 数据存储和测序应用。在此类应用中,DNA 链通过读取其子串的某个子集来完成测序。以往工作针对单字符串情形考虑了两种极端情况:读取所有预定义长度的子串,或者读取互不重叠的子串;而本工作研究该范式的两种扩展。第一种扩展考虑以某个给定最小重叠读取连续子串的设置。文中首先给出了保证唯一重构的码在可达速率上的上界,随后提出了能够渐近达到该上界的高效码构造。在第二种扩展中,我们研究多个字符串被共同重构的设置。给定字符串数量及其长度,我们首先推导出读取子串长度 $\ell$ 的一个下界;该下界是存在具有非零速率的多链重构码所必需的。然后,我们给出了两种此类码的构造,并证明对于渐近表现与该下界一致的 $\ell$ 取值,其速率趋近于 1。
英文摘要:
This paper introduces a new family of reconstruction codes which is motivated by applications in DNA data storage and sequencing. In such applications, DNA strands are sequenced by reading some subset of their substrings. While previous works considered two extreme cases in which all substrings of pre-defined lengths are read or substrings are read with no overlap for the single string case, this work studies two extensions of this paradigm. The first extension considers the setup in which consecutive substrings are read with some given minimum overlap. First, an upper bound is provided on the attainable rates of codes that guarantee unique reconstruction. Then, efficient constructions of codes that asymptotically meet that upper bound are presented. In the second extension, we study the setup where multiple strings are reconstructed together. Given the number of strings and their length, we first derive a lower bound on the read substrings' length $\ell$ that is necessary for the existence of multi-strand reconstruction codes with non-vanishing rates. We then present two constructions of such codes and show that their rates approach 1 for values of $\ell$ that asymptotically behave like the lower bound.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。