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.