19 citations · 40 across the 18 of their papers we have counts for
21 papers
Representing Information on DNA using Patterns Induced by Enzymatic Labeling
Daniella Bar-Lev, Eitan Yaakobi, Zohar Yakhini +1
Enzymatic DNA labeling is a powerful tool with applications in biochemistry, molecular biology, biotechnology, medical science, and genomic research. This paper contributes to the…
The Labeled Coupon Collector Problem with Random Sample Sizes and Partial Recovery
Shoham Shimon Berrebi, Eitan Yaakobi, Zohar Yakhini +1
We extend the Coupon Collector's Problem (CCP) and present a novel generalized model, referred as the k-LCCP problem, where one is interested in recovering a bipartite graph with a…
Conditional Entropies of k-Deletion/Insertion Channels
Shubhransh Singhvi, Omer Sabary, Daniella Bar-Lev +1
The channel output entropy of a transmitted sequence is the entropy of the possible channel outputs and similarly the channel input entropy of a received sequence is the entropy of…
Optimal Almost-Balanced Sequences
Daniella Bar-Lev, Adir Kobovich, Orian Leitersdorf +1
This paper presents a novel approach to address the constrained coding challenge of generating almost-balanced sequences. While strictly balanced sequences have been well studied i…
Representing Information on DNA using Patterns Induced by Enzymatic Labeling
Daniella Bar-Lev, Tuvi Etzion, Eitan Yaakobi +1
Enzymatic DNA labeling is a powerful tool with applications in biochemistry, molecular biology, biotechnology, medical science, and genomic research. This paper contributes to the…
A Combinatorial Perspective on Random Access Efficiency for DNA Storage
Anina Gruica, Daniella Bar-Lev, Alberto Ravagnani +1
We investigate the fundamental limits of the recently proposed random access coverage depth problem for DNA data storage. Under this paradigm, it is assumed that the user informati…
Coding for IBLTs with Listing Guarantees
Daniella Bar-Lev, Avi Mizrahi, Tuvi Etzion +2
The Invertible Bloom Lookup Table (IBLT) is a probabilistic data structure for set representation, with applications in network and traffic monitoring. It is known for its ability…
On the Capacity of DNA Labeling
Dganit Hanania, Daniella Bar-Lev, Yevgeni Nogin +2
DNA labeling is a powerful tool in molecular biology and biotechnology that allows for the visualization, detection, and study of DNA at the molecular level. Under this paradigm, a…
Cover Your Bases: How to Minimize the Sequencing Coverage in DNA Storage Systems
Daniella Bar-Lev, Omer Sabary, Ryan Gabrys +1
Although the expenses associated with DNA sequencing have been rapidly decreasing, the current cost of sequencing information stands at roughly $120/GB, which is dramatically more…
Universal Framework for Parametric Constrained Coding
Daniella Bar-Lev, Adir Kobovich, Orian Leitersdorf +1
Constrained coding is a fundamental field in coding theory that tackles efficient communication through constrained channels. While channels with fixed constraints have a general o…
DNA-Correcting Codes: End-to-end Correction in DNA Storage Systems
Avital Boruchovsky, Daniella Bar-Lev, Eitan Yaakobi
This paper introduces a new solution to DNA storage that integrates all three steps of retrieval, namely clustering, reconstruction, and error correction. DNA-correcting codes are…
Invertible Bloom Lookup Tables with Listing Guarantees
Avi Mizrahi, Daniella Bar-Lev, Eitan Yaakobi +1
The Invertible Bloom Lookup Table (IBLT) is a probabilistic concise data structure for set representation that supports a listing operation as the recovery of the elements in the r…
Generalized Unique Reconstruction from Substrings
Yonatan Yehezkeally, Daniella Bar-Lev, Sagi Marcovich +1
This paper introduces a new family of reconstruction codes which is motivated by applications in DNA data storage and sequencing. In such applications, DNA strands are sequenced by…
On the Size of Balls and Anticodes of Small Diameter under the Fixed-Length Levenshtein Metric
Daniella Bar-Lev, Tuvi Etzion, Eitan Yaakobi
The rapid development of DNA storage has brought the deletion and insertion channel to the front line of research. When the number of deletions is equal to the number of insertions…
Reconstruction from Substrings with Partial Overlap
Yonatan Yehezkeally, Daniella Bar-Lev, Sagi Marcovich +1
This paper introduces a new family of reconstruction codes which is motivated by applications in DNA data storage and sequencing. In such applications, DNA strands are sequenced by…
Codes for Constrained Periodicity
Adir Kobovich, Orian Leitersdorf, Daniella Bar-Lev +1
Reliability is an inherent challenge for the emerging nonvolatile technology of racetrack memories, and there exists a fundamental relationship between codes designed for racetrack…
The Input and Output Entropies of the -Deletion/Insertion Channel
Shubhransh Singhvi, Omer Sabary, Daniella Bar-Lev +1
The channel output entropy of a transmitted word is the entropy of the possible channel outputs and similarly, the input entropy of a received word is the entropy of all possible t…
Adversarial Torn-paper Codes
Daniella Bar-Lev, Sagi Marcovich, Eitan Yaakobi +1
We study the adversarial torn-paper channel. This problem is motivated by applications in DNA data storage where the DNA strands that carry information may break into smaller piece…
On The Decoding Error Weight of One or Two Deletion Channels
Omer Sabary, Daniella Bar-Lev, Yotam Gershon +2
This paper tackles two problems that fall under the study of coding for insertions and deletions. These problems are motivated by several applications, among them is reconstructing…
Deep DNA Storage: Scalable and Robust DNA Storage via Coding Theory and Deep Learning
Daniella Bar-Lev, Itai Orr, Omer Sabary +2
DNA-based storage is an emerging technology that enables digital information to be archived in DNA molecules. This method enjoys major advantages over magnetic and optical storage…
On Levenshtein Balls with Radius One
Daniella Bar-Lev, Tuvi Etzion, Eitan Yaakobi
The rapid development of DNA storage has brought the deletion and insertion channel, once again, to the front line of research. When the number of deletions is equal to the number…