Skip to main content
SpringerLink
Log in

Fast-Search: A New Efficient Variant of the Boyer-Moore String Matching Algorithm

  • Conference paper
  • First Online:
Experimental and Efficient Algorithms (WEA 2003)

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

Included in the following conference series:

Abstract

We present a new variant of the Boyer-Moore string matching algorithm which, though not linear, is very fast in practice.

We compare our algorithm with the Horspool, Quick Search, Tuned Boyer-Moore, and Reverse Factor algorithms, which are among the fastest string matching algorithms for practical uses. It turns out that our algorithm achieve very good results in terms of both time efficiency and number of character inspections, especially in the cases in which the patterns are very short.

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. R. S. Boyer and J. S. Moore. A fast string searching algorithm. Commun. ACM, 20(10):762–772, 1977.

    Article  Google Scholar 

  2. R. A. Baeza-Yates and M. Régnier. Average running time of the Boyer-Moore-Horspool algorithm. Theor. Comput. Sci., 92(1):19–31, 1992.

    Article  MATH  Google Scholar 

  3. M. Crochemore, A. Czumaj, L. Gasieniec, S. Jarominek, T. Lecroq, W. Plandowski, and W. Rytter. Speeding up two string matching algorithms. Algorithmica, 12(4/5):247–267, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  4. L. J. Guibas and A. M. Odiyzko. A new proof of the linearity of the Boyer-Moore string searching algorithm. SIAM J. Comput., 9(4):672–682, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  5. R. N. Horspool. Practical fast searching in strings. Softw. Pract. Exp., 10(6):501–506, 1980.

    Article  Google Scholar 

  6. A. Hume and D. M. Sunday. Fast string searching. Softw. Pract. Exp., 21(11):1221–1248, 1991.

    Article  Google Scholar 

  7. T. Lecroq. New experimental results on exact string-matching. Rapport LIFAR 2000.03, Université de Rouen, France, 2000.

    Google Scholar 

  8. D. M. Sunday. A very fast substring search algorithm. Commun. ACM, 33(8):132–142, 1990.

    Article  Google Scholar 

  9. A. C. Yao. The complexity of pattern matching for a random string. SIAM J. Comput., 8(3):368–387, 1979.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica e Informatica, Università di Catania, Viale Andrea Doria 6, I-95125, Catania, Italy

    Domenico Cantone & Simone Faro

Authors
  1. Domenico Cantone
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Simone Faro
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computer Science and Applied Mathematics, University of Kiel, Olshausenstr. 40, 24098, Kiel, Germany

    Klaus Jansen  & Marian Margraf  & 

  2. IDISIA - Instituto Dalle Molle di Studi sull’Intelligenza Artificiale, Galleria 2, 6928, Manno, Switzerland

    Monaldo Mastrolilli

  3. Université de Genève 4, Switzerland

    José D. P. Rolim

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cantone, D., Faro, S. (2003). Fast-Search: A New Efficient Variant of the Boyer-Moore String Matching Algorithm. In: Jansen, K., Margraf, M., Mastrolilli, M., Rolim, J.D.P. (eds) Experimental and Efficient Algorithms. WEA 2003. Lecture Notes in Computer Science, vol 2647. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44867-5_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-44867-5_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40205-3

  • Online ISBN: 978-3-540-44867-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation