Skip to main content
SpringerLink
Log in

Real-Time String Matching in Sublinear Space

  • Conference paper
Combinatorial Pattern Matching (CPM 2004)

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

Included in the following conference series:

Abstract

We study a problem of efficient utilisation of extra memory space in real-time string matching. We propose, for any constant ε >0, a real-time string matching algorithm claiming O(m ε) extra space, where m is the size of a pattern. All previously known real-time string matching algorithms use Ω(m) extra space.

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. Boyer, R.S., More, J.S.: A Fast String Searching Algorithm. Communication of the ACM 20(10), 762–772 (1977)

    Article  Google Scholar 

  2. Colussi, L.: Correctness and efficiency of string matching algorithms. Information and Control 95, 225–251 (1991)

    MATH  MathSciNet  Google Scholar 

  3. Colussi, L., Galil, Z., Giancarlo, R.: On the exact complexity of string matching. In: Proc. 31st IEEE Symposium on Foundations of Computer Science (FOCS 1990), pp. 135–143 (1990)

    Google Scholar 

  4. Crochemore, M., Perrin, D.: Two-way string-matching. J. Assoc. Comput. Mach. 38(3), 651–675 (1991)

    MATH  MathSciNet  Google Scholar 

  5. Galil, Z.: String Matching in Real Time. Journal of the ACM 28(1), 134–149 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  6. Galil, Z., Giancarlo, R.: The exact complexity of string matching: upper bounds. SIAM J. on Computing 21(3), 407–437 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  7. Galil, Z., Seiferas, J.: Time-space-optimal string matching. J. Comput. System Sci. 26, 280–294 (1983)

    Article  MathSciNet  Google Scholar 

  8. Ga̧sieniec, L., Plandowski, W., Rytter, W.: The zooming method: a recursive approach to time-space efficient string-matching. Theoret. Comput. Sci. 147, 19–30 (1995)

    Article  MathSciNet  Google Scholar 

  9. Ga̧sieniec, L., Plandowski, W., Rytter, W.: Constant-space string matching with smaller number of comparisons: sequential sampling. In: Galil, Z., Ukkonen, E. (eds.) CPM 1995. LNCS, vol. 937, pp. 78–89. Springer, Heidelberg (1995)

    Google Scholar 

  10. Ga̧sieniec, L., Potapov, I.: Time/Space Efficient Compressed Pattern Matching. Fundamenta Informaticae 56(1-2), 137–154 (2003)

    MathSciNet  Google Scholar 

  11. Horspool, R.N.: Practical Fast Searching in Strings. Software, Practice and Experience 10(6), 501–506 (1980)

    Article  Google Scholar 

  12. Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6, 322–350 (1977)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Liverpool, Liverpool, L69 7ZF, UK

    Leszek Gąsieniec & Roman Kolpakov

Authors
  1. Leszek Gąsieniec
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roman Kolpakov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing Science, Simon Fraser University, 8888 University Drive, V5A 1S6, Burnaby, BC, Canada

    Suleyman Cenk Sahinalp

  2. Google Inc., 76 9th Av, 4th Fl., 10011, New York, NY

    S. Muthukrishnan

  3. Tom Sawyer Software, 94612, Oakland, CA, USA

    Ugur Dogrusoz

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gąsieniec, L., Kolpakov, R. (2004). Real-Time String Matching in Sublinear Space. In: Sahinalp, S.C., Muthukrishnan, S., Dogrusoz, U. (eds) Combinatorial Pattern Matching. CPM 2004. Lecture Notes in Computer Science, vol 3109. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27801-6_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27801-6_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22341-2

  • Online ISBN: 978-3-540-27801-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation