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 stings 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.

翻译：当使用DNA作为存储介质时，最大的挑战是保持其稳定性。鸟嘌呤（G）和胞嘧啶（C）的相对出现频率对于DNA的寿命至关重要。此外，反向互补的碱基对不应出现在代码中。这些挑战可以通过适当选择群同态来克服。通过使用核代码编写DNA字符串的存储和检索算法。这些算法的复杂度比现有算法低。本文所述的构造过程能够构造所需大小和反向互补距离的代码。