Dynamic Programming Based DNA Compression Algorithm through Substitution Method

Annwesha Banerjee Majumder, Somsubhra Gupta

In this paper, a DNA sequence compression algorithm through substitution mechanism has been proposed. The field of bioinformatics research deals with huge DNA data, which requires to be compressed for proper storage utilization. Different symbols for the different sequence of occurrence of DNA sequence has been chosen and compressed the sequence. Dynamic programming concepts have been explored in the proposed algorithm.