Super-pattern matching |
| |
Authors: | J. R. Knight E. W. Myers |
| |
Affiliation: | (1) Department of Computer Science, University of Arizona, 85719 Tucson, AZ, USA |
| |
Abstract: | Some recognition problems are either too complex or too ambiguous to be expressed as a simple pattern matching problem using a sequence or regular expression pattern. In these cases, a richer environment is needed to describe the patterns and recognition techniques used to perform the recognition. Some researchers have turned to artificial-intelligence techniques and multistep matching approaches for the problems of gene recognition [5], [7], [18], protein structure recognition [13], and on-line character recognition [6]. This paper presents a class of problems which involve finding matches to patterns of patterns, orsuper- patterns, given solutions to the lower-level patterns. The expressiveness of this problem class rivals that of traditional artificial-intelligence characterizations, and yet polynomial-time algorithms are described for each problem in the class.This work was supported in part by the National Institute of Health under Grant ROI LM04960 and by the Aspen Center for Physics. |
| |
Keywords: | Pattern matching Dynamic programming Extended regular expressions Molecular biology Gene recognition |
本文献已被 SpringerLink 等数据库收录! |
|