Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Information-theoretic foundations of DNA data storage
I Shomorony, R Heckel - Foundations and Trends® in …, 2022 - nowpublishers.com
Due to its longevity and enormous information density, DNA is an attractive medium for
archival data storage. Natural DNA more than 700.000 years old has been recovered, and …
archival data storage. Natural DNA more than 700.000 years old has been recovered, and …
Survey for a Decade of Coding for DNA Storage
Advancements in DNA synthesis and sequencing technologies have enabled the storage of
data on synthetic DNA strands. However, realizing its potential relies on the design of …
data on synthetic DNA strands. However, realizing its potential relies on the design of …
Correcting a single indel/edit for DNA-based data storage: Linear-time encoders and order-optimality
An indel refers to a single insertion or deletion, while an edit refers to a single insertion,
deletion or substitution. In this article, we investigate codes that correct either a single indel …
deletion or substitution. In this article, we investigate codes that correct either a single indel …
Sequence reconstruction under single-burst-insertion/deletion/edit Channel
Y Sun, Y **, G Ge - IEEE Transactions on Information Theory, 2023 - ieeexplore.ieee.org
Motivated by applications in modern storage devices such as DNA storage and racetrack
memories, we study the sequence reconstruction problem which involves two important …
memories, we study the sequence reconstruction problem which involves two important …
Correcting deletions with multiple reads
The sequence reconstruction problem, introduced by Levenshtein in 2001, considers a
communication scenario where the sender transmits a codeword from some codebook and …
communication scenario where the sender transmits a codeword from some codebook and …
Trace reconstruction problems in computational biology
The problem of reconstructing a string from its error-prone copies, the trace reconstruction
problem, was introduced by Vladimir Levenshtein two decades ago. While there has been …
problem, was introduced by Vladimir Levenshtein two decades ago. While there has been …
Error-correcting codes for nanopore sequencing
A Banerjee, Y Yehezkeally… - IEEE Transactions …, 2024 - ieeexplore.ieee.org
Nanopore sequencing, superior to other sequencing technologies for DNA storage in
multiple aspects, has recently attracted considerable attention. Its high error rates, however …
multiple aspects, has recently attracted considerable attention. Its high error rates, however …
Sequence reconstruction problem for deletion channels: A complete asymptotic solution
Transmit a codeword Image 1, that belongs to an (ℓ− 1)-deletion-correcting code of length n,
over a t-deletion channel for some 1≤ ℓ≤ t< n. Levenshtein (2001)[10], proposed the …
over a t-deletion channel for some 1≤ ℓ≤ t< n. Levenshtein (2001)[10], proposed the …
Deletion correcting codes for efficient DNA synthesis
J Chrisnata, HM Kiah - 2023 IEEE International Symposium …, 2023 - ieeexplore.ieee.org
The synthesis of DNA strands remains the most costly part of the DNA storage system. Thus,
to make DNA storage system more practical, the time and materials used in the synthesis …
to make DNA storage system more practical, the time and materials used in the synthesis …
Correcting two-deletion with a constant number of reads
Y Sun, G Ge - IEEE Transactions on Information Theory, 2022 - ieeexplore.ieee.org
Motivated by certain emerging storage media, such as DNA storage and racetrack
memories, we study the problem of designing-reconstruction codes, where the deletion ball …
memories, we study the problem of designing-reconstruction codes, where the deletion ball …