|
Title |
|
DNABIT Compress-Genome Compression Algorithm |
|
Authors |
Pothuraju Rajarajeswari1*, Allam Apparao2 |
|
|
Affiliation |
1DMSSVH college of Engineering, Machilipatnam; 2Jawaharlal Nehru Technological University, Kakinada |
|
|
|
||
|
Article Type |
Software
|
|
|
Date |
Received September 21, 2010; Accepted October 29, 2010; Published January 22, 2011 |
|
|
Abstract |
Data compression is concerned with how information is organized in data. Efficient storage means removal of redundancy from the data being stored in the DNA molecule. Data compression algorithms remove redundancy and is used to understand biologically important molecules. We present a compression algorithm, “DNABIT Compress” for DNA sequences based on a novel algorithm of assigning binary bits for smaller segments of DNA bases to compress both repetitive and non repetitive DNA sequence. Our proposed algorithm achieves the best compression ratio for DNA sequences for larger genome. Significantly better compression results show that “DNABIT Compress” algorithm is the best among the remaining compression algorithms. While achieving the best compression ratios for DNA sequences (Genomes),our new DNABIT Compress algorithm significantly improves the running time of all previous DNA compression programs. Assigning binary bits (Unique BIT CODE) for (Exact Repeats, Reverse Repeats) fragments of DNA sequence is also a unique concept introduced in this algorithm for the first time in DNA compression. This proposed new algorithm could achieve the best compression ratio as much as 1.58 bits/bases where the existing best methods could not achieve a ratio less than 1.72 bits/bases. |
|
|
Keywords
|
Ziv-Lempel, BioCompress, GenCompress, Arithmetic coding, DNAcompress. |
|
|
Citation |
Rajarajeswari & Apparao, Bioinformation 5(8): 350-360 (2011) |
|
|
Edited by |
R Sowdhamini
|
|
|
ISSN |
0973-2063
|
|
|
Publisher |
|
|
|
License |
This is an Open Access article which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly credited. This is distributed under the terms of the Creative Commons Attribution License. |