Fast string searching
- 1 November 1991
- journal article
- Published by Wiley in Software: Practice and Experience
- Vol. 21 (11) , 1221-1248
- https://doi.org/10.1002/spe.4380211105
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- On the exact complexity of string matchingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A very fast substring search algorithmCommunications of the ACM, 1990
- Improved string searchingSoftware: Practice and Experience, 1989
- A tale of two grepsSoftware: Practice and Experience, 1988
- 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 comparison of three string matching algorithmsSoftware: Practice and Experience, 1982
- Practical fast searching in stringsSoftware: Practice and Experience, 1980
- A fast string searching algorithmCommunications of the ACM, 1977
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977