Skip to main content
SpringerLink
Log in

Improving Static Compression Schemes by Alphabet Extension

  • Conference paper
  • First Online:
Combinatorial Pattern Matching (CPM 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1848))

Included in the following conference series:

Abstract

The performance of data compression on a large static text may be improved if certain variable-length strings are included in the character set for which a code is generated. A new method for extending the alphabet is presented, based on a reduction to a graph-theoretic problem. A related optimization problem is shown to be NP-complete, a fast heuristic is suggested, and experimental results are presented.

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

Access this chapter

Log in via an institution
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.

References

  1. Appostolico A., The myriad virtues of subword trees, Combinatorial Algorithms on Words, NATO ASI Series Vol F12, Springer Verlag, Berlin (1985) 85–96.

    Google Scholar 

  2. Aho A.V., Hopcroft J.E., Ullman J.D., The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA (1974).

    MATH  Google Scholar 

  3. Bell T.C., Cleary J.G., Witten I.A., Text Compression, Prentice Hall, Englewood Cliffs, NJ (1990).

    Google Scholar 

  4. Bookstein A., Klein S.T., Compression, Information Theory and Grammars: A Unified Approach, ACM Trans. on Information Systems 8 (1990) 27–49.

    Article  Google Scholar 

  5. Bookstein A., Klein S.T., Raita T., An overhead reduction technique for megastate compression schemes, Information Processing & Management33 (1997) 745–760.

    Article  Google Scholar 

  6. Bookstein A., Klein S.T., Ziff D.A., A systematic approach to compressing a full text retrieval system, Information Processing & Management28 (1992) 795–806.

    Article  Google Scholar 

  7. Even S., Graph Algorithms, Computer Science Press (1979).

    Google Scholar 

  8. Fraenkel A.S., All about the Responsa Retrieval Project you always wanted to know but were afraid to ask, Expanded Summary, Jurimetrics J.16 (1976) 149–156.

    Google Scholar 

  9. Fraenkel A.S., Mor M., Perl Y., Is text compression by prefixes and suffixes practical? Acta Informatica20 (1983) 371–389.

    Article  MathSciNet  Google Scholar 

  10. Garey M.R., Johnson D.S., Computers and Intractability: A Guidetothe Theory of NP-Completeness, W.H. Freeman, San Francisco (1979).

    Google Scholar 

  11. Halldorsson M.M., Radhakrishnan J., Greed is good: approximating independent sets in sparse and bounded degree graphs, Proc. 26th ACM-STOC (1994) 439–448.

    Google Scholar 

  12. Hochbaum D.S., Approximation Algorithms for NP-Hard Problems, PWS Publishing Company, Boston (1997).

    Google Scholar 

  13. Klein S.T., Space and time-efficient decoding with canonical Huffman trees, Proc. 8th Symp. on Combinatorial Pattern Matching, Aarhus, Denmark, Lecture Notes in Computer Science1264, Springer Verlag, Berlin (1997) 65–75.

    Google Scholar 

  14. McCreight E.M., A space economical suffix tree construction algorithm, Journal of the ACM23 (1976) 262–272.

    Article  MATH  MathSciNet  Google Scholar 

  15. Kortsarz G., Peleg D., On choosing dense subgraphs, Proc. 34th FOCS, Palo-Alto, CA (1993) 692–701.

    Google Scholar 

  16. Storer J.A., Szymanski, T.G., Data compression via textual substitution, J. ACM29 (1982) 928–951.

    Article  MATH  MathSciNet  Google Scholar 

  17. Witten I.H., Moffat A., Bell T.C., Managing Gigabytes: Compressing and Indexing Documents and Images, Van Nostrand Reinhold, New York (1994).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, Bar Ilan University, Ramat-Gan, 52900, Israel

    Shmuel T. Klein

Authors
  1. Shmuel T. Klein
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Matematica ed Applicazioni, Universitá die Palermo, Via Archirafi 34, 90123, Palermo, Italy

    Raffaele Giancarlo

  2. Centre de recherches mathématiques, Université de Montréal, CP 6128, succursale Centre-Ville, Montréal, Québec, Canada, H3C 3J7

    David Sankoff

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Klein, S.T. (2000). Improving Static Compression Schemes by Alphabet Extension. In: Giancarlo, R., Sankoff, D. (eds) Combinatorial Pattern Matching. CPM 2000. Lecture Notes in Computer Science, vol 1848. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45123-4_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-45123-4_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67633-1

  • Online ISBN: 978-3-540-45123-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation