Codes for DNA Sequence Profiles
From MaRDI portal
Abstract: We consider the problem of storing and retrieving information from synthetic DNA media. The mathematical basis of the problem is the construction and design of sequences that may be discriminated based on their collection of substrings observed through a noisy channel. This problem of reconstructing sequences from traces was first investigated in the noiseless setting under the name of "Markov type" analysis. Here, we explain the connection between the reconstruction problem and the problem of DNA synthesis and sequencing, and introduce the notion of a DNA storage channel. We analyze the number of sequence equivalence classes under the channel mapping and propose new asymmetric coding techniques to combat the effects of synthesis and sequencing noise. In our analysis, we make use of restricted de Bruijn graphs and Ehrhart theory for rational polytopes.
Cited in
(13)- Codes of nucleotide sequences
- Exordium for DNA codes
- Greedy construction of DNA codes and new bounds
- On conflict free DNA codes
- Spectral concepts in genome informational analysis
- DNA codes for nonadditive stem similarity
- Set-codes with small intersections and small discrepancies
- DNA Codes Based on Stem Similarities Between DNA Sequences
- Information-Theoretic Foundations of DNA Data Storage
- On the number of distinct \(k\)-decks: enumeration and bounds
- Graphs with the unique path property: Structure, cycles, factors, and constructions
- New construction of non-expandable (1, k)-overlap-free codes
- Rank-modulation codes for DNA storage in shotgun sequencing: structure and distance properties
This page was built for publication: Codes for DNA Sequence Profiles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976761)
