Summary: Approximate Subset Matching with Don't Cares
Amihood Amir \Lambda Moshe Lewenstein \Lambda Ely Porat \Lambda
The need for the general task of ``pattern matching''
is ubiquitous. However, the combinatorial model of the
problem varies with the different application domain.
This variability is manifested in a number of research
The Object Space: Text Editing motivates that the
text and pattern be strings. Image processing motivates
that the text and pattern be two dimensional arrays.
In tree pattern matching , that was used for solving
problems with grammars, the text and pattern are trees.
Cole and Hariharan introduced the Subset Matching
problem where the text and patterns are arrays of
sets . The subset matching problem is an interesting
generalization of string matching and has proven useful
in producing more efficient solutions for tree matching.
The Matching Relation: Various applications re
quire a different notion of ``match''. This led to the