Asymptotic Properties of Data Compression and Suffix Trees

IEEE Transactions on Information Theory

Volumn 39, Issue 5, 1993, Pages 1647-1659

  Szpankowski, Wojciech ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

asymptotic analysis; Lempel Ziv parsing algorithm; repeated subwords; suffix trees; Universal data compression

Indexed keywords

ALGORITHMS; DATA COMPRESSION; PROBABILITY;

ASYMPTOTIC ANALYSIS; REPEATED SUBWORDS; SUFFIX TREES;

INFORMATION THEORY;

EID: 0027666860     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.259648     Document Type: Article

References (43)

1. A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley, 1974.
2. A.V. Aho, Algorithms for “finding patterns in strings,” in Handbook of Theoretical Computer Science. Volume A: Algorithms and Complexity, J. van Leeuwen, Ed. Cambridge, MA: The MIT Press, 1990 pp. 255–300.
3. D. Aldous and P. Shields, “A diffusion limit for a class of random-growing binary trees,” Probab. Th. Rel. Fields, 79, 509–542 (1988).
4. A. Apostolico, “The myriad virtues of suffix trees,” in Combinatorial Algorithms on Words. New York: Springer-Verlag, ASI F12, 1985, pp. 85–96
5. A. Apostolico and W. Szpankowski, Self-alignments in Words and Their Applications, J. of Algorithms, 13, 446–467 (1992).
6. R. Arratia and M. Waterman, “The Erdös-Rényi strong law for pattern matching with given proportion of mismatches,” Ann. Probab., vol. 17, pp. 1152–1169, 1989.
7. P. Bender and J.K. Wolf, “New asymptotic bounds and improvements on the Lempel-Ziv data compression algorithm,” IEEE Trans. Inform. Theory, vol. 37, pp. 721–734, 1991.
8. P. Billingsley, Ergodic Theory and Information. New York:Wiley, 1965.
9. A. Blumer, A. Ehrenfeucht, and D. Haussler, “Average size of suffix trees and DAWGS,” Discrete Appl. Mathemat., vol. 24, pp. 3745, 1989.
10. K.L. Chung, and P. Erdös, “On the application of the Borel-Cantelli lemma,” Trans. Amer. Math. Soc., vol. 72, pp. 179–186, 1952.
11. W. Chang, and E. Lawler, Approximate String Matching in Sublinear Expected Time, Proc. of 1990 FOCS, 116–124 (1990).
12. T.M. Cover and J.A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
13. I. Csiszàr and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York:Academic, 1981.
14. L. Devroye, W. Szpankowski, and B. Rais, “A note of the height of suffix trees,” SIAM J. Comput., vol. 21, pp. 48–53, 1992.
15. P. Grassberger, “Estimating the information content of symbol sequences and efficient codes,” IEEE Trans. Inform. Theory, vol. 35, pp. 669–675, 1991.
16. L. Guibas and A. W. Odlyzko, “String overlaps, pattern matching, and nontransitive games,” J. Combinatorial Theory, Series A, vol. 30, pp. 183–208, 1981.
17. P. Jacquet and W. Szpankowski, “Analysis of digital tries with markovian dependency,” IEEE Trans. Inform. Theory, vol. 37, pp. 1470–1475, 1991.
18. ——, “Autocorrelation on words and its applications, analysis of suffix tree by String-Ruler approach,” J. Combinatorial Theory. Ser. A, 1994 (in press).
19. ——, “On the Lempel-Ziv parsing algorithm and its digital tree representation,” INRIA Rapport de Recherche, 1992.
20. S. Karlin and F. Ost, Counts of Long Aligned Word Matches Among Random Letter Sequences, Adv. Appl. Prob., vol. 19, pp. 293–351, 1987.
21. R. Karp, “A characterization of the minimum cycle mean in a digraph,” Discrete Mathemat., vol. 23, pp. 309–311, 1978.
22. J. C. Kieffer, “Sample converses in source coding theory,” IEEE Trans. Inform. Theory, vol. 37, pp. 263–268, 1991.
23. J.F.C. Kingman, Subadditive Processes, in Ecole d'Eté de Probabilités de Saint-Flour V-1975, Lecture Notes in Mathematics, 539, Springer-Verlag, Berlin, 1976.
24. P. Kirschenhofer, H. Prodinger, and W. Szpankowski, “On the variance of the external path in a symmetric digital trie,” Discrete Appl. Mathemat., vol. 25, pp. 129–143, 1989.
25. P. Kirschenhofer, H. Prodinger, and W. Szpankowski, “Digital search trees again revisited: The internal path length perspective,” SIAM J. Comput., 1994, to appear.
26. D. Knuth, The Art of Computer Programming. Sorting and Searching,. Reading, MA: Addison-Wesley, 1973.
27. A. Lempel and J. Ziv, “On the complexity of finite sequences,” IEEE Inform. Theory vol. IT-22, pp. 75–81, 1976.
28. E.M. McCreight, “A space economical suffix tree construction algorithm,” JACM, vol. 23, pp. 262–272, 1976.
29. G. Hardy, J.E. Littlewood, and G. Pólya, Inequalities. Cambridge, MA: Cambridge University Press, 1952.
30. D. Ornstein and B. Weiss, “Entropy and data compression schemes,” IEEE Inform. Theory, to be published.
31. B. Pittel, “Asymptotic growth of a class of random trees,” Ann. Probab., vol. 13, pp. 414–427, 1985.
32. ——, “Paths in a random digital tree: Limiting distributions,” Adv. Appl. Prob., vol. 18, pp. 139–155, 1986.
33. M. Rodeh, V. Pratt, and S. Even, “Linear algorithm for data compression via string matching,” J. ACM, vol. 28, pp. 16–24, 1981.
34. L.V. Romahovski, “Optimization of stationary control of a discrete deterministic process,” Cybernet., vol. 3, pp. 52–62, 1967.
35. P. Shields, “Entropy and prefixes,” Ann. Probab., vol. 20, pp. 403–409, 1992.
36. D. Stoyan, Comparison Methods for Queues and Other Stochastic Models. New York:Wiley, 1983.
37. W. Szpankowski, “Some results on V-ary asymmetric tries,” J. Algorithms, vol. 9, pp. 224–244, 1988.
38. W. Szpankowski, “On the height of digital trees and related problems,” Algorithmica, vol. 6, pp. 256–277, 1991.
39. ——, “A generalized suffix tree and its (un)expected asymptotic behaviors,” SIAM J. Comput., vol. 22, no. 5, 1993.
40. P. Weiner, “Linear pattern matching algorithms,” in Proc. 14th Annu. Symp. Switching and Automata Theory, vol. 1, no. 11, 1973.
41. A. Wyner and J. Ziv, “Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression, ”IEEE Trans. Inform. Theory, vol. 35, pp. 1250–1258, 1989.
42. A. Wyner and J. Ziv, “Fixed data base version of the lempel-ziv data compression algorithm,” IEEE Trans. Inform. Theory, vol. 37, pp. 878–880, 1991.
43. J. Ziv and A. Lempel, “A universal algorithm for sequential data compression,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 337–343, May 1977.