1987 Reports
Data structures and algorithms for approximate string matching
Zvi Galil, Raffaele Giancarlo
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.
Subjects
Files
- CUCS-299-87.pdf application/pdf 1.76 MB Download File
More About This Work
- Academic Units
- Computer Science
- Publisher
- Department of Computer Science, Columbia University
- Series
- Columbia University Computer Science Technical Reports, CUCS-299-87
- Published Here
- December 2, 2011