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.
No takes yet. Share an insight, caveat, or question.
Galil et al. (1988) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: