DNA sequences compression algorithms based on the two bits codation method

Nowadays a large number of DNA sequences is being stored on online databases. To reduce this quantity of information, researchers have been trying to implement new DNA sequences compression techniques based on the LOSSLESS algorithms. In this article we will compare two algorithms using the binary representation of DNA sequences. Those two algorithms are characterized by their ease of implementation. The first one transforms the DNA sequence into extended-ASCII representation while the second algorithm transforms it into a hexadecimal representation. Thereafter, we will apply the RLE technique to further enhance the compression of entire genomes.