Approximate string-matching with q-grams and maximal matches
- 1 January 1992
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 92 (1) , 191-211
- https://doi.org/10.1016/0304-3975(92)90143-4
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- String matching with constraintsPublished by Springer Nature ,2005
- Approximate string matching with suffix automataAlgorithmica, 1993
- Fast parallel and serial approximate string matchingJournal of Algorithms, 1989
- An improved algorithm for approximate string matchingPublished by Springer Nature ,1989
- Fast approximate string matchingSoftware: Practice and Experience, 1988
- Finding approximate patterns in stringsJournal of Algorithms, 1985
- The theory and computation of evolutionary distances: Pattern recognitionJournal of Algorithms, 1980
- Approximate String MatchingACM Computing Surveys, 1980
- A Space-Economical Suffix Tree Construction AlgorithmJournal of the ACM, 1976
- The String-to-String Correction ProblemJournal of the ACM, 1974