An efficient normalized maximum likelihood algorithm for DMA sequence compression

ACM Transactions on Information Systems

Volumn 23, Issue 1, 2005, Pages 3-34

  Korodi, Gergely ^a   Tabus, Ioan ^a  

^a TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

Author keywords

Approximate sequence matching; DNA compression; Normalized maximum likelihood model

Indexed keywords

APPROXIMATE SEQUENCE MATCHING; DNA COMPRESSION; NORMALIZED MAXIMUM LIKELIHOOD MODEL;

ALGORITHMS; DATA ACQUISITION; GENES; MATHEMATICAL MODELS; REDUNDANCY; REGRESSION ANALYSIS;

DNA;

EID: 13844281512     PISSN: 10468188     EISSN: None     Source Type: Journal    
DOI: 10.1145/1055709.1055711     Document Type: Article

References (20)

1. ADJEROH, D., ZHANG, Y., MUKHERJEE, A., POWELL, M., AND BELL, T. 2002. DNA sequence compression using the Burrows-Wheeler Transform. In IEEE Computer Society Bioinformatics Conference, 303.
2. ALTSCHUL, S., GISH, W., MILLER, W., MYERS, E., AND LIPMAN, D. 1990. Basic local alignment search tool. J. Mol. Biol. 215, 403-410.
3. CHEN, X., KWONG, S., AND LI, M. 2001. A compression algorithm for DNA sequences. IEEE Engineering in Medicine and Biology. 61-66.
4. CHEN, X., LI, M., MA, B., AND TROMP, J. 2002. DNACompress: fast and effective DNA sequence compression. Bioinformatics 18, 1696-1698.
5. GRUMBACH, S. AND TAHI, F. 1993. Compression of DNA sequences. In Proceedings of the Data Compression Conference. 340-350.
6. GRUMBACH, S. AND TAHI, F. 1994. A new challenge for compression algorithms: Genetic sequences. J. Inform. Process. Manage. 30, 6, 875-886.
7. LANCTOT, K., LI, M., AND YANG, E. 2000. Estimating DNA sequence entropy. In 11th Annual ACM-SIAM Symposium on Discrete Algorithms. 409-418.
8. LI, M., BADGER, J., CHEN, X., KWONG, S., KEARNEY, P., AND ZHANG, H. 2001. An information based sequence distance and its application to whole mitochondrial genome phylogeny. Bioinformatics 17, 149-154.
9. LI, M., CHEN, X., LI, X., MA, B., AND VITÁNYI, P. 2003. The similarity metric. In 14th Annual ACM-SIAM Symposium on Discrete Algorithms. 863-872.
10. LOEWENSTERN, D. AND YIANILOS, P. 1997. Significantly lower entropy estimates for natural DNA sequences. In Proceedings of the Data Compression Conference. 151-160.
11. MA, B., TROMP, J., AND LI, M. 2002. PatternHunter: Faster and more sensitive homology search. Bioinformatics 18, 440-445.
12. MATSUMOTO, T., SADAKANE, K., AND IMAI, H. 2000. Biological sequence compression algorithms. In Genome Informatics Workshop. Universal Academy Press, 43-52.
13. PEARSON, W. AND LIPMAN, D. 1988. Improved tools for biological sequence comparison. In Proc. Natl. Acad. Sci. USA. Vol. 85. 2444-2448.
14. RISSANEN, J. 1976. Generalized Kraft inequality and arithmetic coding. IBM J. Res. Dev. 20, 3, 198-203.
15. RIVALS, E., DELAHAYE, J., DAUCHET, M., AND DELGRANGE, O. 1995. A guaranteed compression scheme for repetitive DNA sequences. Tech. Rep. IT-285, LIFL Lille I Univ.
16. TABUS, I., KORODI, G., AND RISSANEN, J. 2003a. DNA sequence compression using the normalized maximum likelihood model for discrete regression. In Proceedings of the Data Compression Conference. 253-262.
17. TABUS, I., RISSANEN, J., AND ASTOLA, J. 2003b. Classification and feature gene selection using the normalized maximum likelihood model for discrete regression. Signal Processing, Special Issue on Genomic Signal Processing 83, 4 (April), 713-727.
18. WILBUR, W. AND LIPMAN, D. 1983. Rapid similarity searches of nucleic acid and protein data banks. In Proc. Natl. Acad. Sci. USA. Vol. 80. 726-730.
19. WILLIAMS, H. AND ZOBEL, J. 1997. Compression of nucleotide databases for fast searching. Computer Applications in the Biosciences 13, 5, 549-554.
20. ZIV, J. AND LEMPEL, A. 1977. A universal algorithm for sequential data compression. IEEE Trans. Inform. Theory 23, 3, 337-343.