这是indexloc提供的服务,不要输入任何密码
Skip to main content

Real-Time Streaming String-Matching

  • Conference paper
Combinatorial Pattern Matching (CPM 2011)

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

Included in the following conference series:

  • 1251 Accesses

  • 13 Citations

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 to check access.

Access this chapter

Subscribe and save

Springer+
from $39.99 /Month
  • Starting from 10 chapters or articles per month
  • Access and download chapters and articles from more than 300k books and 2,500 journals
  • Cancel anytime
View plans

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. 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

Authors

Editor information

Editors and Affiliations

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)

Keywords

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Publish with us

Policies and ethics