Practical fast searching in strings (1980)
by
R. Nigel Horspool
| Venue: | Software Practice and Experience |
| Citations: | 94 - 0 self |
BibTeX
@ARTICLE{Horspool80practicalfast,
author = {R. Nigel Horspool},
title = {Practical fast searching in strings},
journal = {Software Practice and Experience},
year = {1980},
volume = {10},
pages = {501--506}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The problem of searching through text to find a specified substring is considered in a practical setting. It is discovered that a method developed by Boyer and Moore can outperform even special-purpose search instructions that may be built into the, computer hardware. For very short substrings however, these special purpose instructions are fastest-provided that they are used in an optimal way. KEY WORDS String searching Pattern matching Text editing Bibliographic search
Citations
| 487 | A fast string searching algorithm - Boyer, Moore - 1977 |
| 33 | On improving the worst case running time of the Boyer-Moore string matching algorithm - Galil - 1979 |
| 20 | Fast pattern matching in strings - Pratt, R - 1997 |
