English
Related papers

Related papers: Insertion and Deletion Correction in Polymer-based…

200 papers

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 both unique string…

Information Theory · Computer Science 2021-06-29 Srilakshmi Pattabiraman , Ryan Gabrys , Olgica Milenkovic

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 consider the problem of correcting mass readout errors in information encoded in binary polymer strings. Our work builds on results for string reconstruction problems using composition multisets [Acharya et al., 2015] and the unique…

Information Theory · Computer Science 2020-01-15 Ryan Gabrys , Srilakshmi Pattabiraman , Olgica Milenkovic

The problem of string reconstruction from substring information has found many applications due to its relevance in DNA- and polymer-based data storage. One practically important and challenging paradigm requires reconstructing mixtures of…

Information Theory · Computer Science 2020-10-22 Ryan Gabrys , Srilakshmi Pattabiraman , Olgica Milenkovic

The problem of reconstructing strings from substring information has found many applications due to its importance in genomic data sequencing and DNA- and polymer-based data storage. One practically important and challenging paradigm…

Information Theory · Computer Science 2021-10-07 Ryan Gabrys , Srilakshmi Pattabiraman , Olgica Milenkovic

The problem of reconstructing strings from their substring spectra has a long history and in its most simple incarnation asks for determining under which conditions the spectrum uniquely determines the string. We study the problem of coded…

Information Theory · Computer Science 2019-04-24 Ryan Gabrys , Olgica Milenkovic

Motivated by applications in polymer-based data storage, we study the problem of reconstructing a string from part of its composition multiset. We give a full description of the structure of the strings that cannot be uniquely reconstructed…

Information Theory · Computer Science 2022-10-18 Zuo Ye , Ohad Elishco

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

The problem of storing large amounts of information safely for a long period of time has become essential. One of the most promising new data storage mediums are the polymer-based data storage systems, like the DNA-storage system. These…

Information Theory · Computer Science 2025-04-21 Ville Junnila , Tero Laihonen , Tuomo Lehtilä

Data storage in DNA is developing as a possible solution for archival digital data. Recently, to further increase the potential capacity of DNA-based data storage systems, the combinatorial composite DNA synthesis method was suggested. This…

Information Theory · Computer Science 2024-05-28 Omer Sabary , Inbal Preuss , Ryan Gabrys , Zohar Yakhini , Leon Anavy , Eitan Yaakobi

The number of zeros and the number of ones in a binary string are referred to as the composition of the string, and the prefix-suffix compositions of a string are a multiset formed by the compositions of the prefixes and suffixes of all…

Information Theory · Computer Science 2025-03-18 Zitan Chen

The demand for innovative synthetic polymers with improved properties is high, but their structural complexity and vast design space hinder rapid discovery. Machine learning-guided molecular design is a promising approach to accelerate…

Soft Condensed Matter · Physics 2024-10-07 Gabriel Vogel , Jana M. Weber

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

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

DNA, with remarkable properties of high density, durability, and replicability, is one of the most appealing storage media. Emerging DNA storage technologies use composite DNA letters, where information is represented by probability…

Information Theory · Computer Science 2025-03-26 Wenkai Zhang , Zhiying Wang

In the \emph{trace reconstruction problem}, an unknown source string $x \in \{0,1\}^n$ is transmitted through a probabilistic \emph{deletion channel} which independently deletes each bit with some fixed probability $\delta$ and concatenates…

Data Structures and Algorithms · Computer Science 2020-12-09 Xi Chen , Anindya De , Chin Ho Lee , Rocco A. Servedio , Sandip Sinha

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

As the global need for large-scale data storage is rising exponentially, existing storage technologies are approaching their theoretical and functional limits in terms of density and energy consumption, making DNA based storage a potential…

Emerging Technologies · Computer Science 2021-10-12 Yotam Nahum , Eyar Ben-Tolila , Leon Anavy

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

To store information at extremely high-density and data-rate, we propose to adapt, integrate, and extend the techniques developed by chemists and molecular biologists for the purpose of manipulating biological and other macromolecules. In…

Emerging Technologies · Computer Science 2017-08-29 M. Mansuripur , P. K. Khulbe , S. M. Kuebler , J. W. Perry , M. S. Giridhar , J. Kevin Erwin , Kibyung Seong , Seth Marder , N. Peyghambarian
‹ Prev 1 2 3 10 Next ›