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 …

This invited review paper has the aim to acquaint the communication theory community with
the emerging topic of molecular data storage. The exposition includes an overview of basic …

Sequencing a DNA strand, as part of the read process in DNA storage, produces multiple
noisy copies which can be combined to produce better estimates of the original strand; this …

Motivated by average-case trace reconstruction and coding for portable DNA-based storage
systems, we initiate the study of coded trace reconstruction, the design and analysis of high …

The deletion-insertion channel takes as input a bit string ${\bf x}\in\{0, 1\}^{n} $, and outputs
a string where bits have been deleted and inserted independently at random. The trace …

In the trace reconstruction problem, an unknown bit string x∈{0, 1} n is observed through the
deletion channel, which deletes each bit of x with some constant probability q, yielding a …

The deletion channel takes as input a bit string x∈{0, 1} n, and deletes each bit
independently with probability q, yielding a shorter string. The trace reconstruction problem …

Motivated by DNA storage systems, this work presents the DNA reconstruction problem, in
which a length-n string, is passing through the DNA-storage channel, which introduces …

This collection of open problems has been circulated since 2018 when, encouraged by
Sean Prendiville, I prepared a draft for the Arithmetic Ramsey Theory workshop in …

New lower bounds for trace reconstruction Page 1 Annales de l’Institut Henri Poincaré -
Probabilités et Statistiques 2021, Vol. 57, No. 2, 627–643 https://doi.org/10.1214/20-AIHP1089 …