Abstract
Day by day the ratio of living organisms are increased and its accumulation in the biological databases creating a major task. In this connection some of the classical algorithms are strived into the world and fails to compress genetic sequences due to the encrypted 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 developed based on comparative study of existing algorithms and which is more applicable for non tandem repeats of DNA sequences in genomes.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have