Tuning the boyer‐moore‐horspool string searching algorithm
Author:
- 1 October 1992
- journal article
- research article
- Published by Wiley in Software: Practice and Experience
- Vol. 22 (10) , 879-884
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Algorithms for string searchingACM SIGIR Forum, 1989
- Improved string searchingSoftware: Practice and Experience, 1989
- On the Expected Sublinearity of the Boyer–Moore AlgorithmSIAM Journal on Computing, 1988
- The Boyer–Moore–Galil String Searching Strategies RevisitedSIAM Journal on Computing, 1986
- A New Proof of the Linearity of the Boyer-Moore String Searching AlgorithmSIAM Journal on Computing, 1980
- A Correct Preprocessing Algorithm for Boyer–Moore String-SearchingSIAM Journal on Computing, 1980
- Practical fast searching in stringsSoftware: Practice and Experience, 1980
- 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