A novel approach to compress dna repetative sequences in bio-informatics

Abstract

In recent days numbers of gigabyte sequences of nucleotides are stored in a common database Genbank. All the victimization Deoxyribonucleic acid sequences for biological functions are to store the large number of Genomes in a compressed type in economically. Despite the fact that Deoxyribonucleic corrosive arrangements are put away in a packed kind, the information on Deoxyribonucleic corrosive groupings square measure hang on in science databases. For a four-letter alphabet in DNA (Adenine(A), Cytosine(C), Guanine(G) and Thymine(T)), an average description length of 2 bits per base is that the max length required to encode DNA. To reexamine the previous art of compression techniques and its merits and de merits, a novel attempt is initiated. Based on the comparative study of existing algorithms a new method proposed for DNA compression without depending on statistics of sequence set.

Untitled

“…The merits, as well as the demerits of the traditional compression methodologies, have been re-examined, and a new attempt has been initiated. Based on the comparative analysis of the traditional methods [14], a new technique has been introduced to compress the DNA sequence without relying on the sequence set statistics. The existing techniques considered only self-references.…”