Approximate string-matching with q-grams and maximal matches

Theoretical Computer Science

Volumn 92, Issue 1, 1992, Pages 191-211

  Ukkonen, Esko ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER METATHEORY--COMPUTATIONAL COMPLEXITY;

STRING-MATCHING ALGORITHMS;

PATTERN RECOGNITION;

EID: 0027113212     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(92)90143-4     Document Type: Article

References (26)

1. The smallest automaton recognizing the subwords of a text
2. Approximate string matching in sublinear expected time
3. Transducers and repetitions
4. String matching with constraints
5. Approximate string matching
6. A new distance metric on strings computable in linear time
7. Data structures and algorithms for approximate string matching
8. An improved algorithm for approximate string-matching
9. Simple and efficient string matching with k mismatches
10. Efficient randomized pattern matching
11. A very fast associative method for the recognition and correction of misspelt words, based on redundant hash-addressing
12. Fast string matching with k differences
13. Fast parallel and serial approximate string matching
14. Binary codes of correcting deletions, insertions and reversals
15. A space-economical suffix tree construction algorithm
16. Fast approximate string matching
17. The theory and computation of evolutionary distances: pattern recognition
18. A mathematical theory of communications
19. Boyer-Moore approach to approximate string matching
20. Finding approximate patterns in strings
21. Algorithms for approximate string matching
22. The string-to-string correction problem
23. Linear pattern matching algorithms