A faster algorithm for approximate string matching
- 1 January 1996
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- A subquadratic algorithm for approximate limited expression matchingAlgorithmica, 1996
- A Subquadratic Algorithm for Approximate Regular Expression MatchingJournal of Algorithms, 1995
- A sublinear algorithm for approximate keyword searchingAlgorithmica, 1994
- Sublinear approximate string matching and biological applicationsAlgorithmica, 1994
- Fast text searchingCommunications of the ACM, 1992
- Approximate string-matching with q-grams and maximal matchesTheoretical Computer Science, 1992
- A very fast substring search algorithmCommunications of the ACM, 1990
- Fast parallel and serial approximate string matchingJournal of Algorithms, 1989
- Finding approximate patterns in stringsJournal of Algorithms, 1985
- The theory and computation of evolutionary distances: Pattern recognitionJournal of Algorithms, 1980