Skip to main content

Optimal Parsing of Strings

  • Conference paper
Combinatorial Algorithms on Words

Part of the book series: NATO ASI Series ((NATO ASI F,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].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. A. Lempel and J. Ziv, “On the Complexity of Finite Sequences”, IEEE Trans. Inf. Theory, IT-22 (Jan. 1976), 75–81.

    Article  MathSciNet  Google Scholar 

  2. LZ1] A. Lempel and J. Ziv, “Compression of Two Dimensional Data”, submitted to IEEE Trans. Inf. Theory.

    Google Scholar 

  3. E.M. McCreight, “A Space-Economical Suffix Tree Construction Algorithm”, J. ACM 23, 2 (April 1976), 262–272.

    Article  MathSciNet  MATH  Google Scholar 

  4. M. Rodeh, V.R. Pratt and S. Even, “Linear Algorithm, for Data Compression Via String Matching”, J. ACM 28, 1 (Jan. 1981), 16–24.

    Article  MathSciNet  MATH  Google Scholar 

  5. J.A. Storer and T.G. Szymanski, “Data Compression Via Textual Substitution”, J. ACM 29, 4 (October 1982), 928–951.

    Article  MathSciNet  MATH  Google Scholar 

  6. R.A. Wagner, “Common Phrases and Minimum-Space Text Storage”, CACM 16, 3 (March 1973), 148–152.

    Google Scholar 

  7. P. Weiner, “Linear Pattern Matching Algorithm”, IEEE 14th Annual Symposium on Switching and Automata Theory, (October 1973), 1–11.

    Google Scholar 

  8. J. Zív and A. Lempel, “A Universal Algorithm for Sequential Data Compression,” IEEE Trans. Inf. Theory, IT-23 (May 1977), 337–343.

    Article  Google Scholar 

  9. J. Ziv and A. Lempel, “A Compression of Individual Sequences Via Variable-Rate Coding”, IEEE Trans. Inf. Theory, IT-24 (Sept. 1978), 530–536.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hartman, A., Rodeh, M. (1985). Optimal Parsing of Strings. In: Apostolico, A., Galil, Z. (eds) Combinatorial Algorithms on Words. NATO ASI Series, vol 12. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-82456-2_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-82456-2_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-82458-6

  • Online ISBN: 978-3-642-82456-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics