Practical fast searching in strings

@article{Horspool1980PracticalFS,
  title={Practical fast searching in strings},
  author={R. N. Horspool},
  journal={Software: Practice and Experience},
  year={1980},
  volume={10}
}
  • R. N. Horspool
  • Published 1980
  • Computer Science
  • Software: Practice and 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. 
String matching in the DNA alphabet
Improved string searching
A Family of Fast Constant-Space Substring Search Algorithms
Fast string searching
A new approach to text searching
A new approach to text searching
Algorithms for string searching
Fast string matching using an n‐gram algorithm
Fast string matching for multiple searches
Experiments With a Fast String Searching Algorithm
...
1
2
3
4
5
...

References

SHOWING 1-5 OF 5 REFERENCES
Fast Pattern Matching in Strings
A fast string searching algorithm
Burroughs Corporation, B6700 Information Systems Reference Manual
  • Burroughs Corporation, B6700 Information Systems Reference Manual
IBM Corporation, System/370 Principles of Operation
  • IBM Corporation, System/370 Principles of Operation