Abstract—Day by day the ratio of living organisms are increased and its accumation in the bilogical databases creating a major task. In this connectin some of the classical algorithms are strived into the world and fails to compress genetic sequences due to the captcha of alphabets. Existing substitution techniques will work on repetitive and non repetitiveness of bases of DNA and they achieve Best compression rates if any sequence may contain tandem repeats. But the category of grasses like maize and rice contains very less repeats (nearer of 27) over 67789 total bps. By working existing techniques on such sequences the results are not bountiful and running on worst case comparisons. This paper introduces a novel Innovative partition group Binary compression technique yields first art compression rates which is far better than existing techniques. This algorithm is develpoed based on comparative study of existing algorithms and which is more applicable for non tandem repeats of DNA sequences in genomes.
Index Terms—Biocompress, dnabit compress, genbit compress, huffbit compress, encode, decode.
V. Hari Prasad is with Department of CSE (e-mail: har iprasadvemulapati@gmail.com).
[PDF]
Cite: V. Hari Prasad, "A New Revisited Compression Technique through Innovative Partiotion Group Binary Compression: A Novel Approach," Lecture Notes on Software Engineering vol. 1, no. 2, pp. 144-147, 2013.