Information-Theoretic Foundations of DNA Data Storage
From MaRDI portal
Recommendations
- Channel models and error correction codes for DNA information storage
- Macro-molecular data storage with petabyte/cm\(^3\) density, highly parallel read/write operations, and genuine 3D storage capability
- Multidimensional data organization and random access in large-scale DNA storage systems
- DNA Computing
- Data storage and processing in cells: an information theoretic approach
Cites work
- scientific article; zbMATH DE number 5764889 (Why is no real title available?)
- scientific article; zbMATH DE number 6900644 (Why is no real title available?)
- A Simple Lower Bound for the Capacity of the Deletion Channel
- Bounds on the capacity of a spectrally constrained Poisson channel
- Capacity Upper Bounds for Deletion-type Channels
- Coded Trace Reconstruction
- Codes Correcting Two Deletions
- Codes for DNA Sequence Profiles
- Codes in the Space of Multisets—Coding for Permutation Channels With Impairments
- Coding Over Sets for DNA Storage
- DNA-Based Storage: Models and Fundamental Limits
- Exact Reconstruction From Insertions in Synchronization Codes
- Explicit Two-Deletion Codes With Redundancy Matching the Existential Bound
- Information Theory of DNA Shotgun Sequencing
- Models and information-theoretic bounds for nanopore sequencing
- New lower bounds for trace reconstruction
- On Optimal k-Deletion Correcting Codes
- On the Capacity of the Discrete-Time Poisson Channel
- Optimal Coding for the Binary Deletion Channel With Small Deletion Probability
- Optimal coding strategies for certain permuting channels
- Optimal mean-based algorithms for trace reconstruction
- Reconstructing strings from random traces
- Reconstruction of objects from a minimum number of distorted patterns
- Runlength-Limited Sequences and Shift-Correcting Codes: Asymptotic Analysis
- Sequence-Subset Distance and Coding for Error Control in DNA-Based Data Storage
- Sharp Analytical Capacity Upper Bounds for Sticky and Related Channels
- String reconstruction from substring compositions
- Subpolynomial trace reconstruction for random strings and arbitrary deletion probability
- Synchronization Strings and Codes for Insertions and Deletions—A Survey
- Synchronization strings: codes for insertions and deletions approaching the Singleton bound
- The Bee-Identification Error Exponent With Absentee Bees
- The Discrete-Time Poisson Channel at Low Input Powers
- Trace reconstruction with \(\exp(O(n^{1/3}))\) samples
- Trace reconstruction with varying deletion probabilities
Cited in
(5)
This page was built for publication: Information-Theoretic Foundations of DNA Data Storage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5863762)
