Advertisement

Optimal Parsing of Strings

  • Alan Hartman
  • Michael Rodeh
Part of the NATO ASI Series book series (volume 12)

Abstract

Parsing of strings has been suggested by Lempel and Ziv, as a tool to define the complexity of strings [LZ1] and to compress them [ZL1, ZL2]. Recently, they have shown that the scheme may be modified to handle two dimensional data [LZ2].

Keywords

Data Compression Vertex Versus Reference Tree Suffix Tree Input String 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [LZ1]
    A. Lempel and J. Ziv, “On the Complexity of Finite Sequences”, IEEE Trans. Inf. Theory, IT-22 (Jan. 1976), 75–81.MathSciNetCrossRefGoogle Scholar
  2. LZ1] A. Lempel and J. Ziv, “Compression of Two Dimensional Data”, submitted to IEEE Trans. Inf. Theory.Google Scholar
  3. [M]
    E.M. McCreight, “A Space-Economical Suffix Tree Construction Algorithm”, J. ACM 23, 2 (April 1976), 262–272.MathSciNetzbMATHCrossRefGoogle Scholar
  4. [RPE]
    M. Rodeh, V.R. Pratt and S. Even, “Linear Algorithm, for Data Compression Via String Matching”, J. ACM 28, 1 (Jan. 1981), 16–24.MathSciNetzbMATHCrossRefGoogle Scholar
  5. [SS]
    J.A. Storer and T.G. Szymanski, “Data Compression Via Textual Substitution”, J. ACM 29, 4 (October 1982), 928–951.MathSciNetzbMATHCrossRefGoogle Scholar
  6. [Wa]
    R.A. Wagner, “Common Phrases and Minimum-Space Text Storage”, CACM 16, 3 (March 1973), 148–152.Google Scholar
  7. [We]
    P. Weiner, “Linear Pattern Matching Algorithm”, IEEE 14th Annual Symposium on Switching and Automata Theory, (October 1973), 1–11.Google Scholar
  8. [ZL1]
    J. Zív and A. Lempel, “A Universal Algorithm for Sequential Data Compression,” IEEE Trans. Inf. Theory, IT-23 (May 1977), 337–343.CrossRefGoogle Scholar
  9. [ZL2]
    J. Ziv and A. Lempel, “A Compression of Individual Sequences Via Variable-Rate Coding”, IEEE Trans. Inf. Theory, IT-24 (Sept. 1978), 530–536.MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Alan Hartman
    • 1
  • Michael Rodeh
    • 1
  1. 1.IBM Israel Scientific CenterHaifaIsrael

Personalised recommendations