Polynomial Based Representation for DNA Sequence Compression and Search

Data compression plays an important role in lesser expensive resource consumption. It is also cumbersome to send a huge amount of data through the network. The data compression techniques help in optimizing physical storage devices as well as it makes easy to transfer the compressed data or file faster through internet or network. Deoxyribonucleic acid or DNA is biological traits presents in human and almost all other living organisms. The DNA contains the genetic information of the living organisms. In this research, various compression algorithms for DNA sequences are studied and compared. The scheme proposed here for compression is the use of a burrows wheeler compression technique. Our proposed algorithm is the modification of the Burrows Wheeler Compression Algorithm (BWCA). The lexicographical sorting of the matrix is replaced by the polynomial base representation of the bases of DNA. This method reduces the time for compression positively. Validation was performed on various datasets that concur the efficiency of the proposed scheme.