International Journal of Computer Vision
An Alphabet Independent Approach to Two-Dimensional Pattern Matching
SIAM Journal on Computing
Alphabet dependence in parameterized matching
Information Processing Letters
Text algorithms
Parameterized pattern matching: algorithms and applications
Journal of Computer and System Sciences
Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
SIAM Journal on Computing
Journal of Algorithms
Improved approximate pattern matching on hypertext
Theoretical Computer Science
Separable attributes: a technique for solving the sub matrices character count problem
SODA '02 Proceedings of the thirteenth 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
A Linear Time Pattern Matching Algorithm Between a String and a Tree
CPM '93 Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching
Multiple Matching of Parameterized Patterns
CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
SIAM Journal on Computing
Parameterized matching with mismatches
Journal of Discrete Algorithms
Plagiarism detection in software using efficient string matching
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part IV
Hi-index | 0.89 |
The classical pattern matching paradigm is that of seeking occurrences of one string in another, where both strings are drawn from an alphabet set @S. In the parameterized pattern matching model, a consistent renaming of symbols from @S is allowed in a match. The parameterized matching paradigm has proven useful in problems in software engineering, computer vision, and other applications. In classical pattern matching, both the text and pattern are strings. Applications such as searching in xml or searching in hypertext require searching strings in non-linear structures such as trees or graphs. There has been work in the literature on exact and approximate parameterized matching, as well as work on exact and approximate string matching on non-linear structures. In this paper we explore parameterized matching in non-linear structures. We prove that exact parameterized matching on trees can be computed in linear time for alphabets in an O(n)-size integer range, and in time O(nlogm) in general, where n is the tree size and m the pattern length. These bounds are optimal in the comparison model. We also show that exact parameterized matching on directed acyclic graphs (DAGs) is NP-complete.