An improved algorithm for approximate string matching
- 1 January 1989
- book chapter
- Published by Springer Nature
- p. 394-404
- https://doi.org/10.1007/bfb0035772
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Fast parallel and serial approximate string matchingJournal of Algorithms, 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
- Algorithms for approximate string matchingInformation and Control, 1985
- An O(n log n) algorithm for finding all repetitions in a stringJournal of Algorithms, 1984
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977
- An Extension of the String-to-String Correction ProblemJournal of the ACM, 1975
- The String-to-String Correction ProblemJournal of the ACM, 1974