We consider the problem of storing and retrieving information from synthetic DNA media. We
introduce the DNA storage channel and model the read process through the use of profile …

In this paper we consider the problem of encoding data into repeat-free sequences in which
sequences are imposed to contain any k-tuple at most once (for predefined k). First, the …

We study the adversarial torn-paper channel. This problem is motivated by applications in
DNA data storage where the DNA strands that carry information may break into smaller …

The classical beltway problem entails recovering a set of points from their unordered
pairwise distances on the circle. This problem can be viewed as a special case of the …

Motivated by mass-spectrometry protein sequencing, we consider the problem of
reconstructing a string from the multisets of its substring composition. We show that all …

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 …

This paper studies reconstruction of strings based upon their substrings spectrum. Under
this paradigm, it is assumed that all substrings of some fixed length are received and the …

The present disclosure provides DNA-based storage system demonstrated through
experimental and theoretical verification that such a platform can easily be implemented in …

A 1-prefix normal word is a binary word with the property that no factor has more 1s than the
prefix of the same length; a 0-prefix normal word is defined analogously. These words arise …

The disclosure relates to a re-writable DNA-based digital storage system with a random
access feature. An example embodiment includes selecting address representations of m …