A New Indexing Method for Approximate String Matching
- 8 July 1999
- book chapter
- Published by Springer Nature
- p. 163-185
- https://doi.org/10.1007/3-540-48452-3_13
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Approximate string-matching over suffix treesPublished by Springer Nature ,2005
- Fast text searching for regular expressions or automaton searching on triesJournal of the ACM, 1996
- A subquadratic algorithm for approximate limited expression matchingAlgorithmica, 1996
- A sublinear algorithm for approximate keyword searchingAlgorithmica, 1994
- Fast text searchingCommunications of the ACM, 1992
- Fast parallel and serial approximate string matchingJournal of Algorithms, 1989
- Finding approximate patterns in stringsJournal of Algorithms, 1985
- The smallest automation recognizing the subwords of a textTheoretical Computer Science, 1985
- The theory and computation of evolutionary distances: Pattern recognitionJournal of Algorithms, 1980
- A general method applicable to the search for similarities in the amino acid sequence of two proteinsJournal of Molecular Biology, 1970