Efficient DNA Compression Using CBT Technique-A Novel Algorithm

Biological databases are growing exponentially due to the excessive surge of DNA sequences storage day by day. Compression thus becomes essential in order to reduce the size of DNA sequence to save not only to reduce storage space but also transmission time in exchanging data between system through web services over internet. The genome of organism contain all hereditary information encoded in DNA in four bases(A,C,G,and T) in terms of repetitive and non repetitive in nature. Many standard compression algorithms are existed to compress genetic sequences. DNA compression algorithms will work on repetitiveness and non repetitiveness of bases of DNA sequences. So our earlier algorithms are achieved high compression rates when the sequence is repetitive. But Such sequences like AT-rich DNA, which constitutes a distinct fraction of the cellular DNA of the archaebacterium Methanococcus voltae, consists of non-repetitive sequences, so earlier compression techniques are not achieved handsome compression rates due to non repetitive fragments are more and more in the sequence and existed algorithms may run in the worst case comparisons. Our proposed novel algorithm CBT (Compression Bit Plane Technique) yields better compression rates in terms of bits per Bases if any sequence contain more non repetitive fragments. The algorithm is also compared with existing ones and is found to achieve better compression ratio than others.