DeepAI AI Chat
Log In Sign Up

Iterative DNA Coding Scheme With GC Balance and Run-Length Constraints Using a Greedy Algorithm

by   Seong-Joon Park, et al.

In this paper, we propose a novel iterative encoding algorithm for DNA storage to satisfy both the GC balance and run-length constraints using a greedy algorithm. DNA strands with run-length more than three and the GC balance ratio far from 50% are known to be prone to errors. The proposed encoding algorithm stores data at high information density with high flexibility of run-length at most m and GC balance between 0.5±α for arbitrary m and α. More importantly, we propose a novel mapping method to reduce the average bit error compared to the randomly generated mapping method, using a greedy algorithm. The proposed algorithm is implemented through iterative encoding, consisting of three main steps: randomization, M-ary mapping, and verification. It has an information density of 1.8616 bits/nt in the case of m=3, which approaches the theoretical upper bound of 1.98 bits/nt, while satisfying two constraints. Also, the average bit error caused by the one nt error is 2.3455 bits, which is reduced by 20.5%, compared to the randomized mapping.


page 1

page 2

page 3

page 4


Survey of Information Encoding Techniques for DNA

Key to DNA storage is encoding the information to a sequence of nucleoti...

Coding for Optimized Writing Rate in DNA Storage

A method for encoding information in DNA sequences is described. The met...

Construction of Multiple Constrained DNA Codes

DNA sequences are prone to creating secondary structures by folding back...

Image Encryption Decryption Using Chaotic Logistic Mapping and DNA Encoding

In this paper we have proposed a method that uses chaotic logistic mappi...

Optimal Reference for DNA Synthesis

In the recent years, DNA has emerged as a potentially viable storage tec...

A constrained Shannon-Fano entropy coder for image storage in synthetic DNA

The exponentially increasing demand for data storage has been facing mor...

Constrained Optimal Querying: Huffman Coding and Beyond

Huffman coding is well known to be useful in certain decision problems i...