Abstract
This paper studies the problem of encoding messages into sequences which can be uniquely recovered from some noisy observations about their substrings. The observed reads comprise consecutive substrings with some given minimum overlap. This coded reconstruction problem has applications in DNA storage. We consider both single-strand reconstruction codes and multi-strand reconstruction codes, where the message is encoded into a single strand or a set of multiple strands, respectively. Various parameter regimes are studied. New codes are constructed, some of whose rates asymptotically attain the upper bounds.
Funding Information
  • National Key Research and Development Program of China (2020YFA0712100)
  • National Natural Science Foundation of China (11971325, 12231014, 12371523)
  • Beijing Scholars Program
  • Major Key Project of Peng Cheng Laboratory (PCL2024AS103)
  • Zhejiang Laboratory BioBit Program (2022YFB507)

This publication has 23 references indexed in Scilit: