Skip to main content
SpringerLink
Log in

Pattern Matching on Compressed Text

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 52 Accesses

Years and Authors of Summarized Original Work

  • 2003; Kida, et al.

  • 2011; Gawrychowski

  • 2013; Gawrychowski

Table 1
Full size table

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 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  1. Amir A, Benson G (1992) Efficient two-dimensional compressed matching. In: Proceedings of the data compression conference (DCC’92), Snowbird, p 279

    Google Scholar 

  2. Amir A, Benson G, Farach M (1996) Let sleeping files lie: pattern matching in Z-compressed files. J Comput Syst Sci 52(2):299–307

    Article  MathSciNet  MATH  Google Scholar 

  3. Brisaboa N, Fariña A, Navarro G, Paramá J (2007) Lightweight natural language text compression. Inf Retr 10:1–33

    Article  Google Scholar 

  4. Charikar M, Lehman E, Liu D, Panigrahy R, Prabhakaran M, Rasala A, Sahai A, Shelat A (2002) Approximating the smallest grammar: Kolmogorov complexity in natural models. In: STOC, Montréal, pp 792–801

    MATH  Google Scholar 

  5. Ga̧sieniec L, Karpinski M, Plandowski W, Rytter W (1996) Efficient algorithms for Lempel-Ziv encoding. In: Proceedings of the 5th Scandinavian workshop on algorithm theory (SWAT’96), Reykjavík. Lecture notes in computer science, vol 1097, pp 392–403

    Google Scholar 

  6. Gawrychowski P (2011) Pattern matching in Lempel-Ziv compressed strings: fast, simple, and deterministic. In: ESA, Saarbrücken, pp 421–432

    MATH  Google Scholar 

  7. Gawrychowski P (2013) Optimal pattern matching in LZW compressed strings. ACM Trans Algorithms 9(3):25

    Article  MathSciNet  MATH  Google Scholar 

  8. Kida T, Takeda M, Shinohara A, Miyazaki M, Arikawa S (2000) Multiple pattern matching in LZW compressed text. J Discret Algorithms 1(1):133–158

    MathSciNet  MATH  Google Scholar 

  9. Kida T, Matsumoto T, Shibata Y, Takeda M, Shinohara A, Arikawa S (2003) Collage systems: a unifying framework for compressed pattern matching. Theor Comput Sci 298(1):253–272

    Article  MathSciNet  MATH  Google Scholar 

  10. Manber U (1997) A text compression scheme that allows fast searching directly in the compressed file. ACM Trans Inf Syst 15(2):124–136

    Article  Google Scholar 

  11. Maruyama S, Tanaka Y, Sakamoto H, Takeda M (2010) Context-sensitive grammar transform: compression and pattern matching. IEICE Trans Inf Syst 93-D(2):219–226

    Article  Google Scholar 

  12. Matsumoto T, Hagio K, Takeda M (2009) A run-time efficient implementation of compressed pattern matching automata. Int J Found Comput Sci 20(4):717–733

    Article  MathSciNet  MATH  Google Scholar 

  13. Miyazaki M, Fukamachi S, Takeda M, Shinohara T (1998) Speeding up the pattern matching machine for compressed texts. Trans Inf Process Soc Jpn 39(9):2638–2648

    MathSciNet  Google Scholar 

  14. Navarro G, Tarhio J (2005) LZgrep: A Boyer-Moore string matching tool for Ziv-Lempel compressed text. Softw Pract Exp 35(12):1107–1130

    Article  Google Scholar 

  15. Rautio J, Tanninen J, Tarhio J (2002) String matching with stopper encoding and code splitting. In: Proceedings of the 13th annual symposium on combinatorial pattern matching (CPM’02), Fukuoka, pp 42–52

    Google Scholar 

  16. Shibata Y, Kida T, Fukamachi S, Takeda M, Shinohara A, Shinohara T, Arikawa S (2000) Speeding up pattern matching by text compression. In: Proceedings of the 4th Italian conference on algorithms and complexity (CIAC’00), Rome. Lecture notes in computer science, vol 1767. Springer, pp 306–315

    Google Scholar 

  17. Shibata Y, Matsumoto T, Takeda M, Shinohara A, Arikawa S (2000) A Boyer-Moore type algorithm for compressed pattern matching. In: Proceedings of the 11th annual symposium on combinatorial pattern matching (CPM’00), Montréal. Lecture notes in computer science, vol 1848. Springer, pp 181–194

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, Kyushu University, Fukuoka, Japan

    Masayuki Takeda

  2. Graduate School of Information Sciences, Tohoku University, Sendai, Japan

    Ayumi Shinohara

Authors
  1. Masayuki Takeda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ayumi Shinohara
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Masayuki Takeda .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Takeda, M., Shinohara, A. (2016). Pattern Matching on Compressed Text. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_81

Download citation

Publish with us

Policies and ethics

Search

Navigation