Data Compression via Textual Substitution

Journal of the ACM (JACM)

Volumn 29, Issue 4, 1982, Pages 928-951

  Storer, James A ^a   Szymanski, Thomas G ^a,b  

^a PRINCETON UNIVERSITY   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

dictionary; macro expansion; NP completeness; Textual substituuon

Indexed keywords

DATA COMPRESSION;

CODES, SYMBOLIC;

EID: 0020190931     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/322344.322346     Document Type: Article

References (38)

1. Aho, A.V., Hopcroft, J.E., And Tjllman, J. D. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.
2. Boyer, R.S. A fast string searching algorithm Commun. ACM 20, 10 (Oct. 1977), 762–772.
3. Cook, S.A. The complexity of theorem proving procedures. Proc. 3rd Ann. ACM Symp. on Theory of Computing, Shaker Heights, Ohio, 1971, pp. 151–158.
4. Gallant, J., Maier, D., And Stoker, J.A. On finding minimal length superstrings. J. Comput. Syst. Sci. 20 (1980), 50–58
5. Garey, M.R., Johnson, D.S., And Stockmeyer, L. Some simplified NP-complete problems. Theor. Comput. Sci. 1 (1976), 237–267.
6. Hagamen, W.D., Lindin, D.J., Long, H.S., And Weber, J.C. Encoding verbal information as unique numbers. IBM Syst. J. 11 (1972), 278–315.
7. Hahn, B. A new technique for compression and storage of data. Commun. ACM 17, 5 (Aug. 1974), 434–436
8. Hufpman, D.A., A method for the construction of minimum-redundancy codes, Proc. IRE 40 (1952), 1098–1101.
9. Karp, R.M. Reducibility among combinatorial problems. In Complexity of Computer Computations, R.E. Miller and J.W. Thatcher, Eds., Plenum Press, New York, 1972, pp. 85–103.
10. Knuth, D.E. The Art of Computer Programming, Vol. 1: Fundamental Algorithms, 2nd ed. Addison-Wesley, Reading, Mass., 1973.
11. Knuth, D.E., Morris, J. H., And Pratt, V.R. Fast pattern matching in strings. SIAM J. Comput. 6, 2 (1977), 323–349.
12. Lempel, A., And Ziv, J. On the complexity of finite sequences. IEEE Trans Inf. Theory IT 22, 1 (1976), 75–81.
13. Lesk, M.E. Compressed text storage. Unpublished Tech. Memo., Bell Laboratories, Murray Hill, N.J., 1970
14. Mccarthy, J.P. Automatic file compression. In International Computing Symposium, North-Holland, Amsterdam, 1973, pp 511–516.
15. Maier, D The complexity of some problems on subsequences and supersequences. Conf on Theoretical Computer Science, University of Waterloo, Waterloo, Ont., Can., 1977, pp. 120–129
16. Maier, D., AND Storer, J.A. A note on the complexity of the superstring problem, Proc 1978 Conf. on Information Sciences and Systems, Baltimore, Md., 1978, pp. 52–60.
17. Majster, M. E. Efficient on-line construction and correction of position trees. Tech. Rep. TR79-393, Dep. of Computer Science, Cornell Univ., Ithaca, N.Y., 1979.
18. Marron, B.A., And De Maine, P.A.D., Automatic data compression. Commun. ACM 10, 11 (Nov. 1967), 711–715
19. Mayne, A., And James, E.B. Information compression by factorising common strings. Comput. J. 18, 2 (1975), 157–160
20. Morris, R., And Thompson, K. Webster's second on the head of a pin. Unpublished. Tech. Memo., Bell Laboratories, Murray Hill, N.J., 1974.
21. Pratt, V.R. Improvements and applications for the Weiner repetition finder. Lecture notes, 3rd revision, 1975.
22. Rodeh, M., Pratt, V R., And Even, S A linear-time algorithm for finding repetitions and its application to data compression, Tech Rep. No. 72, Dep of Computer Sci., Technicon, Israel, 1976.
23. Rodeh, M., Pratt, V.R., And Even, S. linear algorithm for data compression via string matching. J. ACM 28, 1 (Jan 1981), 16–24.
24. Rubin, F Experiments in text file compression. Commun. ACM 19, 11 (Nov. 1976), 617–623.
25. Ruth, S. S., And Kreutzer, P.J. Data compression for large business files. Datamation 18,9 (1972), 62–66
26. Seery, J. B., And Ziv, J. A universal data compression algorithm-Description and preliminary results. Unpublished Tech. Memo., Bell Laboratories, Murray Hill, N.J., 1977.
27. Seery, J.B., And Ziv, J. Further results on universal data compression. Unpublished Tech. Memo., Bell Laboratories, Murray Hill, N.J., 1978.
28. Seiferas, J. Subword trees Lecture notes, 1977
29. Storer, J.A. NP-completeness results concerning data compression. Tech. Rep. 234, Dep. of Electrical Engineering and Computer Science, Princeton Univ., Princeton, N.J., 1977.
30. Storer, J.A. PLCC-A compiler-compiler for PL1 and PLC users. Tech. Rep. 236, Dep. of Electrical Engineering and Computer Science, Princeton Univ., Princeton, N.J., 1977.
31. Storer, J.A. Data compression: Methods and complexity issues. Ph.D. Dissertation, Dep. of Electrical Engineering and Computer Science, Princeton Univ, Princeton, N.J., 1978.
32. Storer, J.A., And Szymanski, T.G. The macro model for data compression. Proc. 10th Ann. ACM Symp. on Theory of Computing, San Diego, Calif., 1978 (extended abstract).
33. Visvalingam, M. Indexing with coded deltas-A data compaction technique. Softw. Pract. Exper 6 (1976), 397–403.
34. Wagner, R.A. Common phrases and minimum-space text storage. Commun. ACM 16, 3 (Mar. 1973), 148–152
35. Weiner, P. Linear pattern matching algorithms. Proc. 14th Annual IEEE Symp. on Switching and Automata Theory, Ames, Iowa, 1973, pp. 1–11.
36. Ziv, J. Coding theorems for individual sequences IEEE Trans. Inf. Theory IT 24,4 (1978) 405–412.
37. Ziv, J, And Lempel, A. A universal algorithm for sequential data compression. IEEE Trans Inf. Theory IT 23, 3 (1977), 337–343.
38. Ziv, J, And Limpel, A. Compression of individual sequences via variable-rate coding. IEEE Trans. Inf. Theory IT 24, 5 (1978), 530–536.