Reconstruction from Substrings with Partial Overlap

05/08/2022
by   Yonatan Yehezkeally, et al.
0

This paper introduces a new family of reconstruction codes which is motivated by applications in DNA data storage and sequencing. In such applications, DNA strands are sequenced by reading some subset of their substrings. While previous works considered two extreme cases in which all substrings of some fixed length are read or substrings are read with no overlap, this work considers the setup in which consecutive substrings are read with some given minimum overlap. First, upper bounds are provided on the attainable rates of codes that guarantee unique reconstruction. Then, we present efficient constructions of asymptotically optimal codes that meet the upper bound.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/10/2022

Generalized Unique Reconstruction from Substrings

This paper introduces a new family of reconstruction codes which is moti...
research
04/20/2023

DNA-Correcting Codes: End-to-end Correction in DNA Storage Systems

This paper introduces a new solution to DNA storage that integrates all ...
research
09/16/2018

Sequence-Subset Distance and Coding for Error Control in DNA Data Storage

The process of DNA data storage can be mathematically modelled as a comm...
research
08/26/2021

Multi-strand Reconstruction from Substrings

The problem of string reconstruction based on its substrings spectrum ha...
research
10/06/2021

Coded Shotgun Sequencing

Most DNA sequencing technologies are based on the shotgun paradigm: many...
research
01/15/2021

Improved Rank-Modulation Codes for DNA Storage with Shotgun Sequencing

We study permutations over the set of ℓ-grams, that are feasible in the ...
research
06/08/2022

Covering Sequences for ℓ-Tuples

de Bruijn sequences of order ℓ, i.e., sequences that contain each ℓ-tupl...

Please sign up or login with your details

Forgot password? Click here to reset