Improved Rank-Modulation Codes for DNA Storage with Shotgun Sequencing

01/15/2021
by   Niv Beeri, et al.
0

We study permutations over the set of ℓ-grams, that are feasible in the sense that there is a sequence whose ℓ-gram frequency has the same ranking as the permutation. Codes, which are sets of feasible permutations, protect information stored in DNA molecules using the rank-modulation scheme, and read using the shotgun sequencing technique. We construct systematic codes with an efficient encoding algorithm, and show that they are optimal in size. The length of the DNA sequences that correspond to the codewords is shown to be polynomial in the code parameters. Non-systematic with larger size are also constructed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/07/2021

Applications of Convolutional Codes to DNA Codes and Error-Correction

Convolutional codes are error-correcting linear codes that utilize shift...
research
01/15/2018

Coding over Sets for DNA Storage

In this paper we study error-correcting codes for the storage of data in...
research
11/29/2022

Construction of Multiple Constrained DNA Codes

DNA sequences are prone to creating secondary structures by folding back...
research
09/18/2020

Improved Coding over Sets for DNA-Based Data Storage

Error-correcting codes over sets, with applications to DNA storage, are ...
research
03/01/2020

Did Sequence Dependent Geometry Influence the Evolution of the Genetic Code?

The genetic code is the function from the set of codons to the set of am...
research
11/25/2022

On DNA Codes Over the Non-Chain Ring ℤ_4+uℤ_4+u^2ℤ_4 with u^3=1

In this paper, we present a novel design strategy of DNA codes with leng...
research
05/08/2022

Reconstruction from Substrings with Partial Overlap

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