Bridging lossy and lossless compression by motif pattern discovery

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4123 LNCS, Issue , 2006, Pages 793-813

  Apostolico, A ^a   Comin, M ^a   Parida, L ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

BIOLOGICAL STRUCTURES; CODEBOOKS; DATA COMPRESSION TECHNIQUES; ENCODINGS; INPUT SEQUENCE; IRREDUNDANT MOTIF; LOSSLESS; LOSSLESS COMPRESSION; LOSSY COMPRESSION METHODS; LOSSY DATA COMPRESSION; MOTIF DISCOVERY; PATTERN DISCOVERY;

MOLECULAR BIOLOGY;

IMAGE COMPRESSION;

EID: 44349171552     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11889342_51     Document Type: Conference Paper

References (31)

1. M.J. Atallah, Y. Genin, and W. Szpankowski, Pattern matching image compression: algorithmic and empirical results, IEEE Transactions on PAMI, Vol. 21, No. 7, 614-629, 1999.
2. A. Apostolico, On the efficiency of syntactic feature extraction and approximate schemes for data compression, Proceedings of the 5th International Conference on Pattern Recognition., 982-984, Miami, Florida, 1980.
3. A. Apostolico and M.J. Atallah, Compact recognizers of episode sequences, Information and Computation, 174, 180-192, 2002.
4. A. Apostolico and Z. Galil (Eds.), Pattern Matching Algorithms, Oxford University Press, New York, 1997.
5. A. Apostolico and A. Fraenkel, Robust transmission of unbounded strings using Fibonacci representations, IEEE Trans. Inform. Theory, Vol. 33, No. 2, 238-245, 1987. (Pubitemid 17565912)
6. A. Apostolico and S. Lonardi, Off-line compression by greedy textual substitution, Proceedings of the IEEE, Vol. 88, No. 11, 1733-1744, 2000.
7. A. Apostolico and L. Parida, Incremental paradigms of motif discovery, Journal of Computational Biology, Vol. 11, No. 1, 15-25, 2004. (Pubitemid 38429361)
8. A. Apostolico and L. Parida, Compression and the wheel of fortune, Proceedings of IEEE DCC Data Compression Conference, Computer Society Press, 143-152, 2003.
9. A. Apostolico, M. Comin, and L. Parida, Motifs in Ziv-Lempel-Welch clef, Proceedings of IEEE DCC Data Compression Conference, 72-81, Computer Society Press, 72-81, 2004.
10. A. Apostolico and F.P. Preparata, Data structures and algorithms for the string statistics problem, Algorithmica, 15, 481-494, 1996. (Pubitemid 126416930)
11. T. Berger, Rate Distortion Theory: A Mathematical Basis for Data Compression, Prentice Hall, Englewood Cliffs, N.J., 1971.
12. T. Berger and J.D. Gibson, Lossy source coding, IEEE Trans. Inform. Theory, Vol. 44, No. 6, 2693-2723, 1998. (Pubitemid 128741904)
13. A. Blumer, J. Blumer, A. Ehrenfeucht, D. Haussler, M.T. Chen, and J. Seiferas, The smallest automaton recognizing the subwords of a text, Theoretical Computer Science, 40, 31-55, 1985. (Pubitemid 16557041)
14. S. DeAgostino and J.A. Storer, On-line versus off-line computation in dynamic text compression, Inform. Process. Lett., Vol. 59, No. 3, 169-174, 1996. (Pubitemid 126394444)
15. K.S. Fu and T.L. Booth, Grammatical inference: introduction and survey - part I, IEEE Transactions on Systems, Man and Cybernetics, 5, 95-111, 1975.
16. K.S. Fu and T.L. Booth, Grammatical inference: introduction and survey - part II, IEEE Transactions on Systems, Man and Cybernetics, 5, 112-127, 1975.
17. J.C. Kieffer, A survey of the theory of source coding with a fidelity criterion, IEEE Trans. Inform. Theory, Vol. 39, No. 5, 1473-1490, 1993.
18. I. Kontoyiannis, An implementable lossy version of Lempel-Ziv algorithm -part 1: optimality for memoryless sources, IEEE Trans. Inform. Theory, Vol. 45, 2293-2305, 1999. (Pubitemid 30514190)
19. E. Lehman and A. Shelat, Approximation algorithms for grammar based compression, Proceedings of the eleventh ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), 205-212, 2002.
20. A. Lempel and J. Ziv, On the complexity of finite sequences, IEEE Trans. Inform. Theory, Vol. 22, 75-81, 1976.
21. T. Luczak and W. Szpankowski, A suboptimal lossy data compression algorithm based on approximate pattern matching, IEEE Trans. Inform. Theory, Vol. 43, No. 5, 1439-1451, 1997. (Pubitemid 127826427)
22. C Neville-Manning, I.H. Witten, and D. Maulsby, Compression by induction of hierarchical grammars, In DCC: Data Compression Conference, IEEE Computer Society TCC, 244-253, 1994.
23. L. Parida, I. Rigoutsos, and D. Piatt, An output-sensitive flexible pattern discovery algorithm, Combinatorial Pattern Matching (CPM 2001), (A. Amir and G. Landau, Eds.), LNCS, Vol. 2089, 131-142, 2001.
24. L. Parida, I. Rigoutsos, A. Floratos, D. Platt, and Y. Gao, Pattern discovery on character sets and real-valued data: linear bound on irredundant motifs and polynomial time algorithms, Proceedings of the eleventh ACM-SIAM Symposium on Discrete Algorithms (SODA 2000), January 2000, 297-308, 2000.
25. I. Rigoutsos, A. Floratos, L. Parida, Y. Gao, and D. Platt, The emergence of pattern discovery techniques in computational biology, Journal of Metabolic Engineering, Vol. 2, No. 3, 159-177, 2000.
26. I. Sadeh, On approximate string matching, Proceedings of DCC 1993, IEEE Computer Society Press, 148-157, 1993.
27. J.A. Storer, Data Compression: Methods and Theory, Computer Science Press, 1988.
28. J. Wang, B. Shapiro, and D. Shasha (Eds.), Pattern Discovery in Biomolecular Data: Tools, Techniques, and Applications, Oxford University Press, 1999.
29. M. Waterman, Introduction to Computational Biology, Chapman and Hall, 1995.
30. J. Ziv and A. Lempel, A universal algorithm for sequential data compression, IEEE Trans. Inform. Theory, Vol. 23, No. 3, 337-343, 1977.
31. J. Ziv and A. Lempel, Compression of individual sequences via variable-rate coding, IEEE Trans. Inform. Theory, Vol. 24, No. 5, 530-536, 1978. (Pubitemid 8631609)