On using q-gram locations in approximate string matching
- 1 January 1995
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Sublinear approximate string matching and biological applicationsAlgorithmica, 1994
- Approximate Boyer–Moore String MatchingSIAM Journal on Computing, 1993
- Fast text searchingCommunications of the ACM, 1992
- A new approach to text searchingCommunications of the ACM, 1992
- Approximate string-matching with q-grams and maximal matchesTheoretical Computer Science, 1992
- Simple and efficient string matching with k mismatchesInformation Processing Letters, 1989
- Efficient randomized pattern-matching algorithmsIBM Journal of Research and Development, 1987
- Finding approximate patterns in stringsJournal of Algorithms, 1985