A fast bit-vector algorithm for approximate string matching based on dynamic programming
- 1 January 1998
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A faster algorithm for approximate string matchingPublished by Springer Nature ,1996
- A sublinear algorithm for approximate keyword searchingAlgorithmica, 1994
- Sublinear approximate string matching and biological applicationsAlgorithmica, 1994
- A new approach to text searchingCommunications of the ACM, 1992
- Theoretical and empirical comparisons of approximate string matching algorithmsPublished by Springer Nature ,1992
- An Improved Algorithm For Approximate String MatchingSIAM Journal on Computing, 1990
- Fast string matching with k differencesJournal of Computer and System Sciences, 1988
- Finding approximate patterns in stringsJournal of Algorithms, 1985
- The theory and computation of evolutionary distances: Pattern recognitionJournal of Algorithms, 1980
- A faster algorithm computing string edit distancesJournal of Computer and System Sciences, 1980