Indel Error Correction Codes for DNA Digital Data Storage and Retrieval

02/15/2023
by   NallappaBhavithran G, et al.
0

A procedure for storage and retrieval of Digital information in DNA strings is discussed by constructing an error correction code which is capable of correcting indel errors and maintaining the stability of DNA strings. For correction of indel errors, Varshamov-Tenengolts algorithm is used. To maintain the stability of DNA code, Reverse-complementary property, and GC-content constraints are implemented by appropriate choices of group homomorphisms. Code for any desired length(n) can be created using the construction methods presented in this paper. The code's reverse complement distance is calculated using the value of n.

READ FULL TEXT
research
04/10/2023

Kernel Code for DNA Digital Data Storage

The biggest challenge when using DNA as a storage medium is maintaining ...
research
04/07/2023

Iterative Soft Decoding Algorithm for DNA Storage Using Quality Score and Redecoding

Ever since deoxyribonucleic acid (DNA) was considered as a next-generati...
research
02/12/2019

On Conflict Free DNA Codes

DNA storage has emerged as an important area of research. The reliabilit...
research
04/06/2022

SPIDER-WEB enables stable, repairable, and encryptible algorithms under arbitrary local biochemical constraints in DNA-based storage

DNA has been considered as a promising medium for storing digital inform...
research
02/01/2019

Some Enumeration Problems in the Duplication-Loss Model of Genome Rearrangement

Tandem-duplication-random-loss (TDRL) is an important genome rearrangeme...
research
12/22/2021

On the Reverse-Complement String-Duplication System

Motivated by DNA storage in living organisms, and by known biological mu...
research
02/09/2007

On the possibility of making the complete computer model of a human brain

The development of the algorithm of a neural network building by the cor...

Please sign up or login with your details

Forgot password? Click here to reset