Approximate Boyer–Moore String Matching
- 1 April 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 22 (2) , 243-260
- https://doi.org/10.1137/0222018
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Simple and efficient string matching with k mismatchesInformation Processing Letters, 1989
- Fast parallel and serial approximate string matchingJournal of Algorithms, 1989
- String searching algorithms revisitedPublished by Springer Nature ,1989
- An improved algorithm for approximate string matchingPublished by Springer Nature ,1989
- Fast string matching with k differencesJournal of Computer and System Sciences, 1988
- Data structures and algorithms for approximate string matchingJournal of Complexity, 1988
- Improved string matching with k mismatchesACM SIGACT News, 1986
- 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