A lossy data compression based on string matching: Preliminary analysis and suboptimal algorithms

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

Volumn 807 LNCS, Issue , 1994, Pages 102-112

  Luczak, Tomasz ^a   Szpankowsk, Wojeiech ^b  

^a POLISH ACADEMY OF SCIENCES   (Poland)

^b PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN MATCHING;

APPROXIMATE STRING MATCHING; APPROXIMATE STRING MATCHING PROBLEM; LOSSY DATA COMPRESSION; MEMORYLESS CHANNELS; PRELIMINARY ANALYSIS; PROBABILISTIC ANALYSIS; PROBABILISTIC ASSUMPTIONS; SUB-OPTIMAL ALGORITHMS;

DATA COMPRESSION;

EID: 5844340378     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58094-8_9     Document Type: Conference Paper

References (24)

1. A.V. Aho, Algorithms for Finding Patterns in Strings, in Handbook of Theoretical Computer Science. Volume A: Algorithms and Complexity (ed. J. van Leeuwen), 255-300, The MIT Press, Cambridge (1990).
2. N. Alon and J. Spencer, The Probabilistic Method, John Wiley&Sons, New York (1992).
3. M. Atallah, P. Jacquet and W. Szpankowski, Pattern matching with mismatches: A probabi]istic analysis and a randomized algorithm, Proc. Combinatorial Pattern Matching, acson, Lecture Notes in Computer Science, 644, (eds. A. Apostolico, M. Crochemore, Z. Galil, U. Manber), pp. 27-40, Springer-Verlag 1992.
4. R. Arratia and M. Waterman, The Erdös-Rönyi Strong Law for Pattern Matching with Given Proportion of Mismatches, Annals of Probability, 17, 1152-1169 (1989).
5. R. Arratia, L. Gordon, and M. Waterman, The Erdös-Rnyi Law in Distribution for Coin Tossing and Sequence Matching, Annals of Statistics, 18, 539-570 (1990)
6. T. Berger, Rate Distortion Theory: A Mathematical Basis for Data Compression, Englewood Cliffs, N J: Prentice-Hall, 1971.
7. P. Billingsley, Convergence of Probability Measure, John Wiley & Sons, New York, 1968.
8. W. Chang, and E. Lawler, Approximate String Matching in Subllnear Expected Time, Proc. of 1990 FOCS, 116-124 (1990).
9. T.M. Cover and J.A. Thomas, Elements of Information Theory, John Wiley&Sons, New York (1991).
10. I. Csiszr and J. Kgrner, Information Theory: Coding Theorems for Discrete Memoryless Systems, Academic Press, New York (1981).
11. J. Feldman, r-Entropy, Equipartition, and Ornstein’s Isomorphism Theory in Rn, Israel J. Math., 36, 321-345 (1980).
12. P. Jacquet and W. Szpankowski, Autoeorrelation on Words and Its Applications. Analysis of Suffix Tree by String-Ruler Approach, J. Combinatorial Theory. Set. A, (1994); to appear.
13. J.C. Kieffer, Strong Converses in Source Coding Relative to a Fidelity Criterion, IEEE Trans. Information Theory, 37, 257-262 (1991).
14. J. C. Kieffer, Sample Converses in Source Coding Theory, IEEE Trans. Information Theory, 37, 263-268 (1991).
15. A. Lempel and J. Ziv, On the Complexity of Finite Sequences, IEEE Information Theory 22, 1, 75-81 (1976).
16. D. Ornsteiu and B. Weiss, Entropy and Data Compression Schemes, IEEE Information Theory, 39, 78-83 (1993).
17. D. Ornstein and P. Shields, Universal Almost Sure Data Compression, Annals of Probability, 18, 441-452 (1990).
18. B. Pittel, Asymptotic Growth of a Class of random Trees, Annals of Probability, 12, 414-427 (1985).
19. Y. Steinberg and M. Gutman, An Algorithm for Source Coding Subject to a Fidelity Criterion, Based on String Matching, IEEE Trans. Information Theory, 39, 877-886 (1993).
20. W. Szpankowski, Asymptotic Properties of Data Compression and Suffix Trees, IEEE Trans. Information Theory, 39, 1647-1659 (1993).
21. W. Szpankowski, A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors, SIAM J. Computing, 22, 1176-1198 (1993).
22. A. Wyner and J. Ziv, Some Asymptotic Properties of the Entropy of a Stationary Ergodic Data Source with Applications to Data Compression, IEEE Trans. Information Theory, 35, 1250-1258 (1989).
23. Z. Zhang and V. Wei, An On-Line Universal Lossy Data Compression Algorithm via Continuous Codebook Refinement, submitted to a journal.
24. J. Ziv and A. Lempel, A Universal Algorithm for Sequential Data Compression, IEEE Trans. Information Theory, 23, 3, 337-343 (1977).