English
Related papers

Related papers: Anchor-Based Correction of Substitutions in Indexe…

200 papers

Encoding data as a set of unordered strings is receiving great attention as it captures one of the basic features of DNA storage systems. However, the challenge of constructing optimal redundancy codes for this channel remained elusive. In…

Information Theory · Computer Science 2023-08-16 Jin Sima , Netanel Raviv , Jehoshua Bruck

In this paper, we study error-correcting codes for the storage of data in synthetic deoxyribonucleic acid (DNA). We investigate a storage model where data is represented by an unordered set of $M$ sequences, each of length $L$. Errors…

Information Theory · Computer Science 2018-05-10 Andreas Lenz , Paul H. Siegel , Antonia Wachter-Zeh , Eitan Yaakobi

The interest in channel models in which the data is sent as an unordered set of binary strings has increased lately, due to emerging applications in DNA storage, among others. In this paper we analyze the minimal redundancy of binary codes…

Information Theory · Computer Science 2019-10-29 Jin Sima , Netanel Raviv , Jehoshua Bruck

A new family of codes, called clustering-correcting codes, is presented in this paper. This family of codes is motivated by the special structure of data that is stored in DNA-based storage systems. The data stored in these systems has the…

Information Theory · Computer Science 2019-03-12 Tal Shinkar , Eitan Yaakobi , Andreas Lenz , Antonia Wachter-Zeh

Error-correcting codes over sets, with applications to DNA storage, are studied. The DNA-storage channel receives a set of sequences, and produces a corrupted version of the set, including sequence loss, symbol substitution, symbol…

Information Theory · Computer Science 2021-07-12 Hengjia Wei , Moshe Schwartz

In this paper we study error-correcting codes for the storage of data in synthetic deoxyribonucleic acid (DNA). We investigate a storage model where a data set is represented by an unordered set of $M$ sequences, each of length $L$. Errors…

Information Theory · Computer Science 2020-02-13 Andreas Lenz , Paul H. Siegel , Antonia Wachter-Zeh , Eitan Yaakobi

Nanopore sequencing, superior to other sequencing technologies for DNA storage in multiple aspects, has recently attracted considerable attention. Its high error rates, however, demand thorough research on practical and efficient coding…

Information Theory · Computer Science 2024-06-21 Anisha Banerjee , Yonatan Yehezkeally , Antonia Wachter-Zeh , Eitan Yaakobi

To increase the information capacity of DNA storage, composite DNA letters were introduced. We propose a novel channel model for composite DNA in which composite sequences are decomposed into ordered standard non-composite sequences. The…

Information Theory · Computer Science 2025-10-31 Besart Dollma , Ohad Elishco , Eitan Yaakobi

DNA is an attractive medium for digital data storage. When data is stored on DNA, errors occur, which makes error-correcting coding techniques critical for reliable DNA data storage. To reduce the errors, a common technique is to include…

Information Theory · Computer Science 2024-06-27 Franziska Weindel , Andreas L. Gimpel , Robert N. Grass , Reinhard Heckel

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 presented as a unique solution to the problem of ensuring…

Information Theory · Computer Science 2024-07-02 Avital Boruchovsky , Daniella Bar-Lev , Eitan Yaakobi

Labeling of DNA molecules is a fundamental technique for DNA visualization and analysis. This process was mathematically modeled in [1], where the received sequence indicates the positions of the used labels. In this work, we develop error…

Information Theory · Computer Science 2025-11-04 Dganit Hanania , Eitan Yaakobi

We consider error-correcting coding for deoxyribonucleic acid (DNA)-based storage using nanopore sequencing. We model the DNA storage channel as a sampling noise channel where the input data is chunked into $M$ short DNA strands, which are…

Information Theory · Computer Science 2024-06-21 Lorenz Welter , Roman Sokolovskii , Thomas Heinis , Antonia Wachter-Zeh , Eirik Rosnes , Alexandre Graell i Amat

Due to their sequential nature, traditional DNA synthesis methods are expensive in terms of time and resources. They also fabricate multiple copies of the same strand, introducing redundancy. This redundancy can be leveraged to enhance the…

Information Theory · Computer Science 2025-10-29 Frederik Walter , Yonatan Yehezkeally

DNA-based storage is an emerging storage technology that provides high information density and long duration. Due to the physical constraints in the reading and writing processes, error correction in DNA storage poses several interesting…

Information Theory · Computer Science 2023-10-04 Jin Sima , Netanel Raviv , Moshe Schwartz , Jehoshua Bruck

In [1], the authors proposed a new model of DNA storage system that integrates all three steps of retrieval and introduced the concept of DNA-correcting codes, which guarantees that the output of the storage system can be decoded to the…

Information Theory · Computer Science 2023-11-17 Huawei Wu

We provide an overview of current approaches to DNA-based storage system design and accompanying synthesis, sequencing and editing methods. We also introduce and analyze a suite of new constrained coding schemes for both archival and random…

Emerging Technologies · Computer Science 2015-07-08 S. M. Hossein Tabatabaei Yazdi , Han Mao Kiah , Eva Ruiz Garcia , Jian Ma , Huimin Zhao , Olgica Milenkovic

As a medium for cold data storage, DNA stands out as it promises significant gains in storage capacity and lifetime. However, it comes with its own data processing challenges to overcome. Constrained codes over the DNA alphabet…

Information Theory · Computer Science 2025-10-08 Canberk İrimağzı , Ahmed Hareedy

In recent years, the emergence of DNA storage systems has led to a widespread focus on the research of codes correcting insertions, deletions, and classic substitutions. During the initial investigation, Levenshtein discovered the VT codes…

Information Theory · Computer Science 2024-01-23 Yuhang Pi , Zhifang Zhang

We consider the problem of coding for the substring channel, in which information strings are observed only through their (multisets of) substrings. Due to existing DNA sequencing techniques and applications in DNA-based storage systems,…

Information Theory · Computer Science 2024-03-27 Yonatan Yehezkeally , Nikita Polyanskii

The process of DNA-based data storage (DNA storage for short) can be mathematically modelled as a communication channel, termed DNA storage channel, whose inputs and outputs are sets of unordered sequences. To design error correcting codes…

Information Theory · Computer Science 2020-06-11 Wentu Song , Kui Cai , Kees A. Schouhamer Immink
‹ Prev 1 2 3 10 Next ›