Data structures and algorithms for approximate string matching
Zvi Galil, Raffaele Giancarlo · Journal of Complexity · 1988
This paper surveys techniques for designing efficient sequential and parallel approximate string matching algorithms. Special attention is given to the methods for the construction of data structures that efficiently support primitive operations needed in approximate string matching.
Cited by 142 works. doi:10.1016/0885-064x(88)90008-8
Authors
References
- The Art of Computer Programming
- The Design and Analysis of Computer Algorithms
- The Art of Computer Programming
- The String-to-String Correction Problem
- Fast Pattern Matching in Strings
- Binary codes capable of correcting deletions, insertions and reversals
- Linear pattern matching algorithms
- Data Structures and Algorithms
- A fast string searching algorithm
- A Space-Economical Suffix Tree Construction Algorithm