Skip to main content
SpringerLink
Log in
Book cover

Annual Symposium on Combinatorial Pattern Matching

CPM 2011: Combinatorial Pattern Matching pp 162–172Cite as

Real-Time Streaming String-Matching

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6661))

Abstract

This paper presents a real-time randomized streaming string matching algorithm that uses O(logm) space. The algorithm only makes one-sided small probability false-positive errors, possibly reporting phantom occurrences of the pattern, but never misses an actual occurrence.

Work partially supported by the European Research Council (ERC) project SFEROT and by the Israeli Science Foundation grants 35/05 and 347/09.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ergun, F., Jowhari, H., Salgan, M.: Periodicity in Streams (2010) (manuscript)

    Google Scholar 

  2. Fine, N.J., Wilf, H.S.: Uniqueness theorems for periodic functions. Proc. Amer. Math. Soc. 16, 109–114 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  3. Galil, Z.: String Matching in Real Time. J. Assoc. Comput. Mach. 28(1), 134–149 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  4. Galil, Z.: Optimal parallel algorithms for string matching. Inform. and Control 67, 144–157 (1985)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  6. Karp, R.M., Rabin, M.O.: Efficient randomized pattern matching algorithms. IBM J. Res. Develop. 31(2), 249–260 (1987)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  8. Porat, B., Porat, E.: Exact And Approxiamate Pattern Matching In The Streaming Model. In: Proc. 50th IEEE Symp. on Foundations of Computer Science, pp. 315–323 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Caesarea Rothchild Institute, University of Haifa, Haifa, Israel

    Dany Breslauer

  2. College of Computing, Georgia Institute of Technology, Atlanta, Georgia, USA

    Zvi Galil

Authors
  1. Dany Breslauer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zvi Galil
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, Università degli Studi di Palermo, Via Archirafi 34, 90123, Palermo, Italy

    Raffaele Giancarlo

  2. Department of Computer Science, University of ’Piemonte Orientale’, Viale T. Michel 11, 15121, Alessandria, Italy

    Giovanni Manzini

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Breslauer, D., Galil, Z. (2011). Real-Time Streaming String-Matching. In: Giancarlo, R., Manzini, G. (eds) Combinatorial Pattern Matching. CPM 2011. Lecture Notes in Computer Science, vol 6661. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21458-5_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21458-5_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21457-8

  • Online ISBN: 978-3-642-21458-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation