Home

Data structures and algorithms for approximate string matching Zvi Galil, Raffaele Giancarlo

Zvi Galil; Raffaele Giancarlo

Title:
Data structures and algorithms for approximate string matching Zvi Galil, Raffaele Giancarlo
Author(s):
Galil, Zvi
Giancarlo, Raffaele
Date:
Type:
Technical reports
Department:
Computer Science
Persistent URL:
Series:
Columbia University Computer Science Technical Reports
Part Number:
CUCS-299-87
Publisher:
Department of Computer Science, Columbia University
Publisher Location:
New York
Abstract:
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.
Subject(s):
Computer science
Item views
166
Metadata:
text | xml
Suggested Citation:
Zvi Galil, Raffaele Giancarlo, 1987, Data structures and algorithms for approximate string matching Zvi Galil, Raffaele Giancarlo, Columbia University Academic Commons, http://hdl.handle.net/10022/AC:P:11869.

Center for Digital Research and Scholarship at Columbia University Libraries | Terms of Use | Copyright