The Boyer–Moore–Galil String Searching Strategies Revisited
- 1 February 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 15 (1) , 98-105
- https://doi.org/10.1137/0215007
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Time-space-optimal string matchingJournal of Computer and System Sciences, 1983
- A Correct Preprocessing Algorithm for Boyer–Moore String-SearchingSIAM Journal on Computing, 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
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977
- Efficient string matchingCommunications of the ACM, 1975