Reconstruction from Noisy Substrings
Preprint
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 to 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
This publication has 16 references indexed in Scilit:
- Break-Resilient Codes for Forensic 3D Fingerprinting2024
- Nearly Optimal Robust Positioning PatternsIEEE Transactions on Information Theory, 2021
- Repeat-Free CodesIEEE Transactions on Information Theory, 2021
- Reconstruction of Strings From Their Substrings SpectrumIEEE Transactions on Information Theory, 2021
- Unique Reconstruction of Coded Strings From Multiset Substring SpectraIEEE Transactions on Information Theory, 2019
- Mutually Uncorrelated Codes for DNA StorageIEEE Transactions on Information Theory, 2018
- Codes for DNA Sequence ProfilesIEEE Transactions on Information Theory, 2016
- Simple and Robust Binary Self-Location PatternsIEEE Transactions on Information Theory, 2012
- Efficient Reconstruction of Sequences from Their Subsequences or SupersequencesJournal of Combinatorial Theory, Series A, 2001
- Approximate string-matching with q-grams and maximal matchesTheoretical Computer Science, 1992