DNA sequence compression using the normalized maximum likelihood model for discrete regression

Data Compression Conference Proceedings

Volumn 2003-January, Issue , 2003, Pages 253-262

  Tabus, Ioan ^a   Korodi, Gergely ^a   Rissanen, Jorma ^a  

^a TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

Author keywords

Biological information theory; Biological system modeling; Biomedical signal processing; Data compression; Dictionaries; DNA; Encoding; Entropy; History; Sequences

Indexed keywords

BIOLOGICAL SYSTEMS; BIOMEDICAL SIGNAL PROCESSING; DATA HANDLING; DNA; DNA SEQUENCES; ENCODING (SYMBOLS); ENTROPY; GLOSSARIES; HISTORY; INFORMATION THEORY; MARKOV PROCESSES; MAXIMUM LIKELIHOOD; RANGE FINDING; SIGNAL PROCESSING;

BIOLOGICAL INFORMATION THEORIES; BIOLOGICAL SYSTEM MODELING; FIRST-ORDER MARKOV MODEL; MINIMUM DESCRIPTION LENGTH; NORMALIZED MAXIMUM LIKELIHOOD; NORMALIZED MAXIMUM LIKELIHOOD MODEL; SEQUENCE COMPRESSION; SEQUENCES;

DATA COMPRESSION;

EID: 34547630306     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCC.2003.1194016     Document Type: Conference Paper

References (14)

1. D. Adjeroh, Yong Zhang, A. Mukherjee, M. Powell, T. Bell, DNA sequence compression using the Burrows-Wheeler transform, Proceedings of IEEE Computer Society Bioinformatics Conference, CSP-02, pp. 303 - 313, 14-16 August 2002.
2. A. Apostolico, A.S. Fraenkel, Robust transmission of unbounded strings using Fibonacci representations, IEEE Trans. on Information Theory , vol.33, no. 2, 238-245, 1987.
3. A. Apostolico, S. Lonardi. Compression of biological sequences by greedy off-line textual, substitution Data Compression Conference, DCC 2000, pp. 143-152, 2000
4. A. Barron, J. Rissanen, Y. Bin, The minimum description length principle in coding and modeling, IEEE Trans. on Information Theory, Special commemorative issue: Information Theory 1948-1998, vol.44, no. 6, 2743-2760, 1998.
5. X. Chen, S. Kwong, M. Li A compression algorithm for DNA sequences: using approximate matching for better compression ratio to reveal the true characteristics of DNA, IEEE Engineering in Medicine and Biology, vol.20:4, pp. 61-66, July/August 2001.
6. T.M. Cover Enumerative source encoding, IEEE Trans. Info. Theory, vol. IT-19, pp. 73 - 77, 1973.
7. S. Grumbach, F. Tahi, Compression of DNA sequences, Data Compression Conference 1993, DCC '93, 340 -350, 1993.
8. D. Loewenstern, P.N. Yianilos, Significantly lower entropy estimates for natural DNA sequences, Data Compression Conference, DCC '97, 151 -160, 1997.
9. J.K. Lanctot, M. Li, E. Yang Estimating DNA sequence entropy, Proc. of Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, January 9-11, San Francisco, pp. 409-418, 2000.
10. E. Rivals, J.P. Delahaye, M. Dauchet, O. Delgrange A guaranteed compression scheme for repetitive DNA sequences, LIFL Lille 1 Univ. Tech Rep. IT-285, 1995.
11. J. Rissanen, "Strong optimality of the normalized ML models as universal codes and information in data", IEEE Trans. on Information Theory, vol.IT-47, No. 5, 1712-1717, 2001.
12. K. Sadakane, T. Okazaki, H. Imai, Implementing the context tree weighting method for text compression, Proceedings of Data Compression Conference, DCC 2000, pp. 123-132, 2000.
13. Yu.M. Shtarkov, "Universal sequential coding of single messages", Translated from Problems of Information Transmission, Vol. 23, No. 3, 3-17, 1987.
14. I. Tabus, J. Rissanen, J. Astola, Classification and feature gene selection using the normalized maximum likelihood model for discrete regression. Signal Processing, Special issue on genomic signal processing, in print. Also available at http://sigwww.cs.tut.fi/-tabus/GSP.pdf