Two algorithms for approxmate string matching in static texts
Petteri Jokinen, Esko Ukkonen · Lecture notes in computer science · 1991
Cited by 151 works. doi:10.1007/3-540-54345-7_67
Authors
References
- Linear pattern matching algorithms
- A Space-Economical Suffix Tree Construction Algorithm
- Efficient randomized pattern-matching algorithms
- The smallest automation recognizing the subwords of a text
- Approximate String Matching
- Approximate string-matching with q-grams and maximal matches
- Fast string matching with k differences
- Data structures and algorithms for approximate string matching
- An Improved Algorithm For Approximate String Matching
- Transducers and repetitions