An offensive algorithm for multi-pattern parameterized string matching

Finding a pattern P[0...m-1] in a large body of text T[0...n-1], m≤n, is called pattern matching. One of its variation is parameterized string matching. Two strings are said to parameterized match, if one can be transformed into other via some bijective mapping. The parameterized matching has important applications in software maintenance and plagiarism detection. In this paper, we propose a new algorithm for multi-pattern parameterized string matching problem. This is an extension of quick multiple matching algorithm for exact string matching. Experimental results show that the new algorithm is very fast in practice.