Answers are grounded in this paper and cite their sources.
The problem of reconstructing strings from substring information has found many applications due to its importance in genomic data sequencing and DNA- and polymer-based data storage. One important paradigm requires reconstructing mixtures of strings based on the union of compositions of their prefixes and suffixes, generated by mass spectrometry devices. We describe new coding methods that allow for unique joint reconstruction of subsets of strings selected from a code and provide upper and lower bounds on the asymptotic rate of the underlying codebooks. Our code constructions combine properties of binary <tex-math notation="LaTeX">Bₕ </tex-math> and Dyck strings that can be extended to accommodate missing substrings in the pool. As auxiliary results, we present simple entropy upper bounds for binary <tex-math notation="LaTeX">Bₕ </tex-math> codes and an improved bound for <tex-math notation="LaTeX">$h=4$ </tex-math> , and also describe errors that arise during mass spectrometry.
No takes yet. Share an insight, caveat, or question.
Gabrys et al. (2022) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: