Optimised cost considering Huffman code for biological data compression
by Youcef Gheraibia; Sohag Kabir; Abdelouahab Moussaoui; Smaine Mazouzi
International Journal of Information and Communication Technology (IJICT), Vol. 13, No. 3, 2018

Abstract: Classical Huffman code has been widely used to compress biological datasets. Though a considerable reduction of size of data can be obtained by classical Huffman code, a more efficient encoding is possible by treating binary bits differently considering requirement of transmission time, energy consumption, and similar. A number of techniques have already modified the Huffman code algorithm to obtain optimal prefix-codes for unequal letter costs in order to reduce overall transmission cost (time). In this paper, we propose a new approach to improve compression performance of one such extension, the cost considering approach (CCA), by applying a genetic algorithm for optimal allocation of the codewords to the symbols. The idea of the proposed approach is to sacrifice some cost to minimise the total number of bits, hence, the genetic algorithm works by giving penalty on the cost. The performance of the approach is evaluated by using it to compress some standard biological datasets. The experiments show that the proposed approach improves the compression performance of the CCA considerably without increasing the cost significantly.

Online publication date: Thu, 30-Aug-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Communication Technology (IJICT):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com