Abstract
Purchase PDF (609 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (8)
Purchase PDF (561 K)
> 0, we give simple randomized and deterministic algorithms that compute 
doi:10.1016/0020-0190(95)00007-Y 
Copyright © 1995 Published by Elsevier Science B.V.
Approximately matching context-free languages
Gene Myers
, 1
Received 14 July 1994;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
Given a string w and a pattern p, approximate pattern matching merges traditional sequence comparison and pattern matching by asking for the minimum difference between w and a string exactly matched by p. We give an O(PN2(N + log P)) algorithm for approximately matching a string of length N and a context-free language specified by a grammar of size P. The algorithm generalizes the Cocke-Younger-Kasami algorithm for determining membership in a context-free language. We further sketch an O(P5N88p) algorithm for the problem where gap costs are concave and pose two open problems for such general comparison cost models.
Author Keywords: Design of algorithms; Pattern matching; Sequence comparison
