Practical fast searching in strings

R. Nigel Horspool
1980 Software, Practice & Experience  
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.
doi:10.1002/spe.4380100608 fatcat:frlexobf6jbbtmcvdfd4bvdt4u