Daniella Bar-Lev
  • Bio
  • Publications
  • Talks
  • Education & Experience
  • Teaching
  • Experience
  • Publications
    • A Combinatorial Perspective on Random Access Efficiency for DNA Storage
    • The Labeled Coupon Collector Problem
    • Conditional Entropies of k-Deletion/Insertion Channels
    • A Single-Bit Redundancy Framework for Multi-Dimensional Parametric Constraints
    • DNA-Correcting Codes: End-to-End Correction in DNA Storage Systems
    • On the Capacity of DNA Labeling
    • Scalable and robust DNA-based storage via coding theory and deep learning
    • Cover Your Bases: How to Minimize the Sequencing Coverage in DNA Storage Systems
    • A Combinatorial Perspective on Random Access Efficiency for DNA Storage
    • Representing Information on DNA Using Patterns Induced by Enzymatic Labeling
    • Universal Framework for Parametric Constrained Coding
    • Optimal Almost-Balanced Sequences
    • The Zettabyte Era is in Our DNA
    • Invertible Bloom Lookup Tables with Listing Guarantees
    • Design of Optimal Labeling Patterns for Optical Genome Mapping via Information Theory
    • Generalized Unique Reconstruction From Substrings
    • Coding for IBLTs with Listing Guarantees
    • Cover Your Bases: How to Minimize the Sequencing Coverage in DNA Storage Systems
    • DNA-Correcting Codes: End-to-end Correction in DNA Storage Systems
    • On the Capacity of DNA Labeling
    • On the Size of Balls and Anticodes of Small Diameter Under the Fixed-Length Levenshtein Metric
    • Adversarial Torn-Paper Codes
    • Exciting Coding Problems for DNA-based Storage Systems
    • The Input and Output Entropies of the k-Deletion/Insertion Channel with Small Radii
    • Codes for Constrained Periodicity
    • Reconstruction from Substrings with Partial Overlap
    • Adversarial Torn-paper Codes
    • The Intersection of Insertion and Deletion Balls
    • Decoding for Optimal Expected Normalized Distance over the t-Deletion Channel
    • On Levenshtein Balls with Radius One

Cover Your Bases: How to Minimize the Sequencing Coverage in DNA Storage Systems

Jan 1, 2025·
Bar lev d.
,
Sabary o.
,
Gabrys r.
,
Yaakobi e.
· 0 min read
DOI PDF
Type
Journal article
Publication
IEEE Transactions on Information Theory
Last updated on Jan 1, 2025
Authors
Bar lev d.
Authors
Sabary o.
Authors
Gabrys r.
Authors
Yaakobi e.
← Scalable and robust DNA-based storage via coding theory and deep learning Apr 1, 2025
A Combinatorial Perspective on Random Access Efficiency for DNA Storage Jul 7, 2024 →

Unless otherwise noted, this work is licensed under CC BY NC SA 4.0, and code samples are licensed under the MIT License.

Made with Hugo Blox. Duplicate this template →