Approximate string matching with suffix automata

Algorithmica

Volumn 10, Issue 5, 1993, Pages 353-364

  Ukkonen, Esko ^a   Wood, Derick ^b  

^a UNIVERSITY OF HELSINKI   (Finland)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Aho Corasick automaton; Approximate string matching; Dynamic programming; Edit distance; Suffix automaton

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; DYNAMIC PROGRAMMING;

AHO CORASICK AUTOMATION; EDIT DISTANCE; STRING MATCHING; SUFFIX AUTOMATION;

AUTOMATA THEORY;

EID: 0027700453     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/BF01769703     Document Type: Article

References (14)

1. Efficient string matching: an aid to bibliographic search
2. The smallest automaton recognizing the subwords of a text
3. Transducers and repetitions
4. Data structures and algorithms for approximate string matching
5. An improved algorithm for approximate string matching
6. Time optimal left to right construction of position trees
7. Fast string matching with k differences
8. Fast parallel and serial approximate string matching
9. An O(ND) difference algorithm and its variations
10. The theory and computation of evolutionary distances: pattern recognition
11. Algorithms for approximate string matching
12. Finding approximate patterns in strings
13. The string-to-string correction problem