Reconstruction From Noisy Substrings
- 3 September 2024
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 70 (11) , 7757-7776
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.Keywords
All Related Versions
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:
- Adversarial Torn-paper Codes2022
- Capacity of the Torn Paper Channel with Lost Pieces2021
- On Codes for the Noisy Substring Channel2021
- Maximum Length of Robust Positioning Sequences2020
- Reconstruction from subsequencesJournal of Combinatorial Theory, Series A, 2003
- Efficient Reconstruction of Sequences from Their Subsequences or SupersequencesJournal of Combinatorial Theory, Series A, 2001
- Efficient reconstruction of sequencesIEEE Transactions on Information Theory, 2001
- Reconstructing sequencesDiscrete Mathematics, 1997
- Approximate string-matching with q-grams and maximal matchesTheoretical Computer Science, 1992
- Reconstruction of sequencesDiscrete Mathematics, 1991