Practical fast searching in strings
Author:
- 1 June 1980
- journal article
- research article
- Published by Wiley in Software: Practice and Experience
- Vol. 10 (6) , 501-506
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.Keywords
This publication has 3 references indexed in Scilit:
- On improving the worst case running time of the Boyer-Moore string matching algorithmCommunications of the ACM, 1979
- A fast string searching algorithmCommunications of the ACM, 1977
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977