Text algorithms
Decision problems for patterns
Journal of Computer and System Sciences
Theoretical Computer Science
On the equivalence problem for E-pattern languages
Theoretical Computer Science
Pattern matching algorithms
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Hardness of Approximating Problems on Cubic Graphs
CIAC '97 Proceedings of the Third Italian Conference on Algorithms and Complexity
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Computational complexity of generalized pattern matching
Computational complexity of generalized pattern matching
Data & Knowledge Engineering
| Hi-index | 0.00 |
In the context sensitive string matching problem, we are given a pattern and a text. The pattern is a string over variables and constants and the text is a string of constants. The goal is to find if there is a mapping from variables to strings of constants so that on applying this mapping to the pattern we get the given text. Languages like Perl and Python support such a sophisticated string matching. The problem is known to be NP-Complete. In this paper, we consider a weighted version of this problem that checks how close the pattern can be matched with the text. We show that this variation is MAXSNP-Complete and cannot be approximated within a factor of 3313/3312. We show that even the restriction, where the pattern consists of variables only, is NP-Complete and MAXSNP-Complete. When the alphabet is bounded, we give an approximation algorithm for this restriction.