Title: Kernel code for DNA digital data storage

Authors: G. Nallappa Bhavithran; R. Selvakumar

Addresses: Department of Mathematics, Vellore Institute of Technology, Vellore, Tamil Nadu – 632014, India ' Department of Mathematics, Vellore Institute of Technology, Vellore, Tamil Nadu – 632014, India

Abstract: The biggest challenge when using DNA as a storage medium is maintaining its stability. The relative occurrence of guanine (G) and cytosine (C) is essential for the longevity of DNA. In addition to that, reverse complementary base pairs should not be present in the code. These challenges are overcome by a proper choice of group homomorphisms. Algorithms for storage and retrieval of information in DNA strings are written by using kernel code. Complexities of these algorithms are less compared to the existing algorithms. Construction procedures followed in this paper are capable of constructing codes of required sizes and reverse-complement distance.

Keywords: kernel code; DNA storage; group homomorphism; DNA code; indel errors; concatenated codes.

DOI: 10.1504/IJBIC.2023.134978

International Journal of Bio-Inspired Computation, 2023 Vol.22 No.2, pp.99 - 104

Accepted: 02 Aug 2023
Published online: 22 Nov 2023 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article