English
Related papers

Related papers: On the Reverse-Complement String-Duplication Syste…

200 papers

Due to its higher data density, longevity, energy efficiency, and ease of generating copies, DNA is considered a promising storage technology for satisfying future needs. However, a diverse set of errors including deletions, insertions,…

Information Theory · Computer Science 2022-08-05 Yuanyuan Tang , Shuche Wang , Hao Lou , Ryan Gabrys , Farzad Farnoud

In a DNA sequence, we have the celebrated Watson-Crick complement $\overline{T}=A$, $\overline{A}=T$, $\overline{C}=G$, and $\overline{G}=C$. Given an integer $m\ge 2$, a secondary structure in a DNA sequence refers to the existence of two…

Information Theory · Computer Science 2023-04-25 Hui Chu , Chen Wang , Yiwei Zhang

A tandem duplication denotes the process of inserting a copy of a segment of DNA adjacent to its original position. More formally, a tandem duplication can be thought of as an operation that converts a string $S = AXB$ into a string $T =…

Computational Complexity · Computer Science 2021-03-16 Ferdinando Cicalese , Nicolò Pilati

Composite DNA is a recent method to increase the base alphabet size in DNA-based data storage.This paper models synthesizing and sequencing of composite DNA and introduces coding techniques to correct substitutions, losses of entire…

Information Theory · Computer Science 2025-10-29 Frederik Walter , Omer Sabary , Antonia Wachter-Zeh , Eitan Yaakobi

Because of its high data density and longevity, DNA is emerging as a promising candidate for satisfying increasing data storage needs. Compared to conventional storage media, however, data stored in DNA is subject to a wider range of errors…

Information Theory · Computer Science 2020-08-20 Yuanyuan Tang , Farzad Farnoud

Motivated by polymer-based data-storage platforms that use chains of binary synthetic polymers as the recording media and read the content via tandem mass spectrometers, we propose a new family of codes that allows for unique string…

Information Theory · Computer Science 2019-04-22 Srilakshmi Pattabiraman , Ryan Gabrys , Olgica Milenkovic

We study codes that can correct backtracking errors during nanopore sequencing. In this channel, a sequence of length $n$ over an alphabet of size $q$ is being read by a sliding window of length $\ell$, where from each window we obtain only…

Information Theory · Computer Science 2024-08-16 Wenjun Yu , Zuo Ye , Moshe Schwartz

Motivated by studies of data retrieval in polymer-based storage systems, we consider the problem of reconstructing a multiset of binary strings that have the same length and the same weight from the compositions of their prefixes and…

Discrete Mathematics · Computer Science 2024-11-07 Yaoyu Yang , Zitan Chen

Maximal repetition of a string is the maximal length of a repeated substring. This paper investigates maximal repetition of strings drawn from stochastic processes. Strengthening previous results, two new bounds for the almost sure growth…

Information Theory · Computer Science 2020-03-11 Łukasz Dębowski

DNA storage has emerged as an important area of research. The reliability of DNA storage system depends on designing the DNA strings (called DNA codes) that are sufficiently dissimilar. In this work, we introduce DNA codes that satisfy a…

Information Theory · Computer Science 2022-11-28 Krishna Gopal Benerjee , Sourav Deb , Manish K Gupta

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

We consider the problem of binary string reconstruction from the multiset of its substring compositions, i.e., referred to as the substring composition multiset, first introduced and studied by Acharya et al. We introduce a new algorithm…

Information Theory · Computer Science 2023-06-05 Utkarsh Gupta , Hessam Mahdavifar

A method to construct and count all the linear codes (of arbitrary length) in $\mathbb{F}_{4}$ that are invariant under reverse permutation and that contain the repetition code is presented. These codes are suitable for constructing DNA…

Information Theory · Computer Science 2025-06-25 E. J. García-Claro

We study codes that can detect the exact number of deletions and insertions in concatenated binary strings. We construct optimal codes for the case of detecting up to $\del$ deletions. We prove the optimality of these codes by deriving a…

Information Theory · Computer Science 2021-05-04 Serge Kas Hanna , Rawad Bitar

The majority of the human genome consists of repeated sequences. An important type of repeated sequences common in the human genome are tandem repeats, where identical copies appear next to each other. For example, in the sequence…

Information Theory · Computer Science 2016-11-18 Siddharth Jain , Farzad Farnoud , Jehoshua Bruck

Motivated by mass-spectrometry protein sequencing, we consider a simply-stated problem of reconstructing a string from the multiset of its substring compositions. We show that all strings of length 7, one less than a prime, or one less than…

Discrete Mathematics · Computer Science 2014-03-12 Jayadev Acharya , Hirakendu Das , Olgica Milenkovic , Alon Orlitsky , Shengjun Pan

Non-binary codes correcting multiple deletions have recently attracted a lot of attention. In this work, we focus on multiplicity-free codes, a family of non-binary codes where all symbols are distinct. Our main contribution is a new…

Information Theory · Computer Science 2025-08-06 Michael Schaller , Beatrice Toesca , Van Khu Vu

We consider the inverse-folding problem for RNA secondary structures: for a given (pseudo-knot-free) secondary structure find a sequence that has that structure as its ground state. If such a sequence exists, the structure is called…

Biological Physics · Physics 2015-06-26 Bernd Burghardt , Alexander K. Hartmann

Tandem duplication in DNA is the process of inserting a copy of a segment of DNA adjacent to the original position. Motivated by applications that store data in living organisms, Jain {\em et al.} (2016) proposed the study of codes that…

Combinatorics · Mathematics 2017-11-20 Yeow Meng Chee , Johan Chrisnata , Han Mao Kiah , Tuan Thanh Nguyen

Efficient continual learning in humans is enabled by a rich set of neurophysiological mechanisms and interactions between multiple memory systems. The brain efficiently encodes information in non-overlapping sparse codes, which facilitates…

Neural and Evolutionary Computing · Computer Science 2023-01-13 Fahad Sarfraz , Elahe Arani , Bahram Zonooz