Theoretical and empirical comparisons of approximate string matching algorithms
- 1 January 1992
- book chapter
- Published by Springer Nature
- p. 175-184
- https://doi.org/10.1007/3-540-56024-6_14
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Approximate string matching in sublinear expected timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- An Improved Algorithm For Approximate String MatchingSIAM Journal on Computing, 1990
- Fast parallel and serial approximate string matchingJournal of Algorithms, 1989
- Fast string matching with k differencesJournal of Computer and System Sciences, 1988
- Data structures and algorithms for approximate string matchingJournal of Complexity, 1988
- Critical Phenomena in Sequence MatchingThe Annals of Probability, 1985
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984
- Approximate String MatchingACM Computing Surveys, 1980
- Some limit results for longest common subsequencesDiscrete Mathematics, 1979
- A Space-Economical Suffix Tree Construction AlgorithmJournal of the ACM, 1976