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 correcting indel errors, Varshamov–Tenengolts algorithm is
used. In the VT algorithm, syndrome is calculated using the position
values of the retrieved word. Then, the wrongly added or deleted
positions can be found by the syndrome and weight of the retrieved word.
The stability of DNA strings depends on the proportionate occurrence of
guanine (G) and cytosine (C). Reverse complementary property is
essential for preventing de-hybridization. To ensure these properties,
VT encoded information is mapped to DNA strings 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 by using the value of n.