A block coding method that leads to significantly lower entropy values for the proteins and coding sections of Haemophilus influenzae
- 1 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings. IEEE Computer Society Bioinformatics Conference
- Vol. 2, 287-293
- https://doi.org/10.1109/csb.2003.1227329
Abstract
A simple statistical block code in combination with the LZW-based compression utilities gzip and compress has been found to increase by a significant amount the level of compression possible for the proteins encoded in Haemophilus influenzae, the first fully sequenced genome. The method yields an entropy value of 3.665 bits per symbol (bps), which is 0.657 bps below the maximum of 4.322 bps and an improvement of 0.452 bps over the best known to date of 4.118 bps using Matsumoto, Sadakane, and Imai's Iza-CTW algorithm. Calculations based on a compact inverse genetic code show that the genome has a maximum entropy of 1.757 bps for the coding regions, with a possibly lower actual entropy. These results hint at the existence of hitherto unexplored redundancies that do not show up in Markov models and are indicative of more internal structure than suspected in both the protein and the genome.Keywords
This publication has 5 references indexed in Scilit:
- A new challenge for compression algorithms: Genetic sequencesPublished by Elsevier ,2002
- External memory algorithms and data structuresACM Computing Surveys, 2001
- Significantly Lower Entropy Estimates for Natural DNA SequencesJournal of Computational Biology, 1999
- Protein is incompressiblePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1999
- Statistical Analysis of Deoxyribonucleic Acid Sequence Data--A ReviewJournal of the Royal Statistical Society Series A: Statistics in Society, 1989