Author:
Al-okaily Anas,Tbakhi Abdelghani
Abstract
ABSTRACTData compression is a fundamental problem in the fields of computer science, information theory, and coding theory. The need for compressing data is to reduce the size of the data so that the storage and the transmission of them become more efficient. Motivated from resolving the compression of DNA data, we introduce a novel encoding algorithm that works for any textual data including DNA data. Moreover, the design of this algorithm paves a novel approach so that researchers can build up on and resolve better the compression problem of DNA or textual data.
Publisher
Cold Spring Harbor Laboratory
Reference166 articles.
1. A method for the construction of minimum-redundancy codes;Proc. IRE,1952
2. Dynamic huffman coding;J. algorithms,1985
3. Design and analysis of dynamic huffman codes;J. ACM (JACM),1987
4. A mathematical theory of communication;ACM SIGMOBILE mobile computing communications review,2001
5. Fano, R. M. The transmission of information (Massachusetts Institute of Technology, Research Laboratory of Electronics …, 1949).