Data compression plays an important role to deal with high volumes of DNA sequences in the field of Bioinformatics. Again data compression techniques directly affect the alignment of DNA sequences. So the time needed to decompress a compressed sequence has to be given equal priorities as with compression ratio. This article contains first introduction then a brief review of different biological sequence compression after that my proposed work then our two improved Biological sequence compression algorithms after that result followed by conclusion and discussion, future scope and finally references. These algorithms gain a very good compression factor with higher saving percentage and less time for compression and decompression than the previous Biological Sequence compression algorithms. Keywords: Hash map table, Tandem repeats, compression factor, compression time, saving percentage, compression, decompression process.
[1]
Heba Afify,et al.
DNA Lossless Differential Compression Algorithm based on Similarity of Genomic Sequence Database
,
2011,
ArXiv.
[2]
Rajendra Kumar Bharti,et al.
A Biological Sequence Compression Based on Cross Chromosomal Similarities Using Variable length LUT
,
2011
.
[3]
R. K. Bharti,et al.
A Biological Sequence Compression based on Look up Table (LUT) using Complementary Palindrome of Fixed Size
,
2011
.
[4]
Sudipta Roy,et al.
Image Steganography Using DNA Sequence and Sudoku Solution Matrix
,
2012
.
[5]
Allam Apparao,et al.
DNABIT Compress – Genome compression algorithm
,
2011,
Bioinformation.
[6]
P. Raja Rajeswari,et al.
Genbit Compress Tool(GBC): A Java-Based Tool to Compress DNA Sequences and Compute Compression Ratio(bits/base) of Genomes
,
2010,
ArXiv.
[7]
Hyoung Do Kim,et al.
DNA Data Compression Based on the Whole Genome Sequence
,
2009,
J. Convergence Inf. Technol..