Skip to main content
SpringerLink
Log in

Searching Texts - But Fast! The Boyer-Moore-Horspool Algorithm

  • Chapter
Algorithms Unplugged

Abstract

This chapter considers the problem of searching in texts. More precisely, we have to determine whether a given string is contained in some text. A human being can determine this efficiently for short search strings and a text that is not too long, but it is not easy to design an efficient search procedure for a computer. The author presents a search method that is very fast in practice even though there are some cases where the search time might be large.

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 89.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 119.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

  1. TU Kaiserslautern, Kaiserslautern, Germany

    Markus E. Nebel

Authors
  1. Markus E. Nebel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Lehrstuhl für Informatik I, Algorithmen und Komplexität, RWTH Aachen, Ahornstr. 55, Aachen, 52074, Germany

    Berthold Vöcking

  2. Institut für Informatik, Freie Universität Berlin, Takustr. 9, Berlin, 14195, Germany

    Helmut Alt

  3. Institut für Theoretische Informatik, Fakultät für Informatik, Technische Universität Ilmenau, Helmholtzplatz 1, Ilmenau, 98693, Germany

    Martin Dietzfelbinger

  4. Institut für Theoretische Informatik, Universität zu Lübeck, Ratzeburger Allee 160, Lübeck, 23538, Germany

    Rüdiger Reischuk

  5. Institut für Informatik, Universität Paderborn, Fürstenallee 11, Paderborn, 33102, Germany

    Christian Scheideler

  6. Institut für Theoretische Informatik, Leibniz Universität Hannover, Appelstr. 4, Hannover, 30167, Germany

    Heribert Vollmer

  7. Institut für Theoretische Informatik, Karlsruhe Institute of Technology (KIT), Am Fasanengarten 5, Karlsruhe, 76131, Germany

    Dorothea Wagner

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Nebel, M.E. (2011). Searching Texts - But Fast! The Boyer-Moore-Horspool Algorithm. In: Vöcking, B., et al. Algorithms Unplugged. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15328-0_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15328-0_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15327-3

  • Online ISBN: 978-3-642-15328-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation