Practical fast searching in strings
R. Nigel HorspoolSchool of Computer Science, McGill University, 805 Sherbrooke Street West, Montreal, Quebec H3A 2K6, Canada
1980en
ABI
Abstract
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.
Identifiers
Citations and references
Cited by 20 references