Coded Shotgun Sequencing

10/06/2021
by   Aditya Narayan Ravi, et al.
0

Most DNA sequencing technologies are based on the shotgun paradigm: many short reads are obtained from random unknown locations in the DNA sequence. A fundamental question, studied in arXiv:1203.6233, is what read length and coverage depth (i.e., the total number of reads) are needed to guarantee reliable sequence reconstruction. Motivated by DNA-based storage, we study the coded version of this problem;i.e., the scenario where the DNA molecule being sequenced is a codeword from a predefined codebook. Our main result is an exact characterization of the capacity of the resulting shotgun sequencing channel as a function of the read length and coverage depth. In particular, our results imply that, while in the uncoded case, O(n) reads of length greater than 2logn are needed for reliable reconstruction of a length-n binary sequence, in the coded case, only O(n/logn) reads of length greater than logn are needed for the capacity to be arbitrarily close to 1.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/14/2021

Trellis BMA: Coded Trace Reconstruction on IDS Channels for DNA Storage

Sequencing a DNA strand, as part of the read process in DNA storage, pro...
research
05/13/2023

On the Capacity of DNA Labeling

DNA labeling is a powerful tool in molecular biology and biotechnology t...
research
05/11/2021

Constrained Consensus Sequence Algorithm for DNA Archiving

The paper describes an algorithm to compute a consensus sequence from a ...
research
05/09/2023

Cover Your Bases: How to Minimize the Sequencing Coverage in DNA Storage Systems

Although the expenses associated with DNA sequencing have been rapidly d...
research
05/08/2022

Reconstruction from Substrings with Partial Overlap

This paper introduces a new family of reconstruction codes which is moti...
research
09/26/2021

The DNA Storage Channel: Capacity and Error Probability

The DNA storage channel is considered, in which M Deoxyribonucleic acid ...
research
10/10/2022

Generalized Unique Reconstruction from Substrings

This paper introduces a new family of reconstruction codes which is moti...

Please sign up or login with your details

Forgot password? Click here to reset