Two algorithms for approxmate string matching in static texts
- 1 January 1991
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 240-248
- https://doi.org/10.1007/3-540-54345-7_67
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Approximate string matching in sublinear expected timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Approximate string-matching with q-grams and maximal matchesTheoretical Computer Science, 1992
- Fast approximate string matchingSoftware: Practice and Experience, 1988
- Data structures and algorithms for approximate string matchingJournal of Complexity, 1988
- Efficient randomized pattern-matching algorithmsIBM Journal of Research and Development, 1987
- Transducers and repetitionsTheoretical Computer Science, 1986
- The smallest automation recognizing the subwords of a textTheoretical Computer Science, 1985
- Approximate String MatchingACM Computing Surveys, 1980
- A Space-Economical Suffix Tree Construction AlgorithmJournal of the ACM, 1976
- Linear pattern matching algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1973