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. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Nebel, M. E. (2011). Searching texts - But fast! the Boyer-Moore-Horspool algorithm. In Algorithms Unplugged (pp. 47–56). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-15328-0_6
Mendeley helps you to discover research relevant for your work.