English
Related papers

Related papers: Correcting a Single Deletion in Reads from a Nanop…

200 papers

Recent advances in DNA sequencing technology and DNA storage systems have rekindled the interest in deletion channels. Multiple recent works have looked at variants of sequence reconstruction over a single and over multiple deletion…

Information Theory · Computer Science 2020-06-01 Sundara Rajan Srinivasavaradhan , Michelle Du , Suhas Diggavi , Christina Fragouli

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

Motivation: Detection of structural variants (SV) from the alignment of sample DNA reads to the reference genome is an important problem in understanding human diseases. Long reads that can span repeat regions, along with an accurate…

Genomics · Quantitative Biology 2023-01-25 Dhaivat Joshi , Suhas Diggavi , Mark J. P. Chaisson , Sreeram Kannan

Motivation: New long read sequencers promise to transform sequencing and genome assembly by producing reads tens of kilobases long. However their high error rate significantly complicates assembly and requires expensive correction steps to…

Genomics · Quantitative Biology 2017-07-18 Antoine Recanati , Thomas Brüls , Alexandre d'Aspremont

Consider a binary word being transmitted through a communication channel that introduces deletable errors where each bit of the word is either retained, flipped, erased or deleted. The simplest code for correcting \emph{all} possible…

Information Theory · Computer Science 2018-05-03 Ghurumuruhan Ganesan

DNA has many valuable characteristics that make it suitable for a long-term storage medium, in particular its durability and high information density. DNA can be stored safely for hundreds of years with virtually no degradation, in contrast…

Quantitative Methods · Quantitative Biology 2022-05-31 Jamie J. Alnasir , Thomas Heinis , Louis Carteron

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

In DNA-based data storage, DNA codes with biochemical constraints and error correction are designed to protect data reliability. Single-stranded DNA sequences with secondary structure avoidance (SSA) help to avoid undesirable secondary…

Information Theory · Computer Science 2023-07-04 Shu Liu , Chaoping Xing , Yaqian Zhang

Nanopore protein sequencing produces long, noisy ionic current traces in which key molecular phases, such as protein capture and translocation, are embedded. Capture phases mark the successful entry of a protein into the pore and serve as…

Machine Learning · Computer Science 2025-11-04 Annabelle Martin , Daphne Kontogiorgos-Heintz , Jeff Nivala

In nanopore sequencing, electrical signal is measured as DNA molecules pass through the sequencing pores. Translating these signals into DNA bases (base calling) is a highly non-trivial task, and its quality has a large impact on the…

Machine Learning · Computer Science 2021-05-18 Vladimír Boža , Peter Perešíni , Broňa Brejová , Tomáš Vinař

Due to its high data density and longevity, DNA is considered a promising medium for satisfying ever-increasing data storage needs. However, the diversity of errors that occur in DNA sequences makes efficient error-correction a challenging…

Information Theory · Computer Science 2020-11-12 Yuanyuan Tang , Farzad Farnoud

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 strands in DNA-based storage systems. Under this paradigm,…

Information Theory · Computer Science 2025-06-23 Omer Sabary , Daniella Bar-Lev , Yotam Gershon , Alexander Yucovich , Eitan Yaakobi

Motivated by DNA-based storage applications, we study the problem of reconstructing a coded sequence from multiple traces. We consider the model where the traces are outputs of independent deletion channels, where each channel deletes each…

Information Theory · Computer Science 2022-07-13 Serge Kas Hanna

Nanopore genome sequencing is the key to enabling personalized medicine, global food security, and virus surveillance. The state-of-the-art base-callers adopt deep neural networks (DNNs) to translate electrical signals generated by nanopore…

Hardware Architecture · Computer Science 2020-08-10 Qian Lou , Sarath Janga , Lei Jiang

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

Motivated by the sequence reconstruction problem initiated by Levenshtein, reconstruction codes were introduced by Cai \emph{et al}. to combat errors when a fixed number of noisy channels are available. The central problem on this topic is…

Information Theory · Computer Science 2022-07-05 Rongsheng Wu , Xiande Zhang

Construction of capacity achieving deletion correcting codes has been a baffling challenge for decades. A recent breakthrough by Brakensiek $et~al$., alongside novel applications in DNA storage, have reignited the interest in this…

Information Theory · Computer Science 2018-06-26 Jin Sima , Netanel Raviv , Jehoshua Bruck

We propose a new compression scheme for genomic data given as sequence fragments called reads. The scheme uses a reference genome at the decoder side only, freeing the encoder from the burdens of storing references and performing…

Information Theory · Computer Science 2023-02-10 Yotam Gershon , Yuval Cassuto

The sequence reconstruction problem, introduced by Levenshtein in 2001, considers a communication scenario where the sender transmits a codeword from some codebook and the receiver obtains multiple noisy reads of the codeword. Motivated by…

Information Theory · Computer Science 2020-04-14 Johan Chrisnata , Han Mao Kiah , Eitan Yaakobi

Synthetic DNA can in principle be used for the archival storage of arbitrary data. Because errors are introduced during DNA synthesis, storage, and sequencing, an error-correcting code (ECC) is necessary for error-free recovery of the data.…

Quantitative Methods · Quantitative Biology 2018-12-05 William H. Press , John A. Hawkins