Searching Texts - But Fast! The Boyer-Moore-Horspool Algorithm
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.
Unable to display preview. Download preview PDF.