Simple and efficient string matching with k mismatches

Information Processing Letters

Volumn 33, Issue 3, 1989, Pages 113-120

  Grossi, R ^a   Luccio, F ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

approximate string matching; Design of algorithms; mismatches; suffix tree

Indexed keywords

MATHEMATICAL TECHNIQUES--TREES;

ALGORITHM DESIGN; STRING MATCHING; SUFFIX TREES;

COMPUTER PROGRAMMING;

EID: 0024766111     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(89)90188-9     Document Type: Article

References (8)

1. A fast string searching algorithm
2. Improved string matching with k mismatches
3. Data structures and algorithms for approximate string matching
4. An improved algorithm for approximate string matching
5. Time-space-optimal string matching
6. Fast pattern matching in strings
7. Fast string matching with k differences
8. Fast parallel and serial approximate string matching