Efficient parameterized string matching

  title={Efficient parameterized string matching},
  author={Kimmo Fredriksson and Maxim Mozgovoy},
  journal={Inf. Process. Lett.},
In parameterized string matching the pattern P matches a substring t of the text T if there exist a bijective mapping from the symbols of P to the symbols of t. We give simple and practical algorithms for finding all such pattern occurrences in sublinear time on average. The algorithms work for a single and multiple patterns. 
Highly Cited
This paper has 35 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.
Showing 1-10 of 23 extracted citations

Parameterized string matching: an application to software maintenance

ACM SIGSOFT Software Engineering Notes • 2010
View 7 Excerpts
Highly Influenced

Efficient multi-word parameterized matching on compressed text

2014 IEEE 6th International Conference on Adaptive Science & Technology (ICAST) • 2014
View 2 Excerpts

Fast parameterized word matching on compressed text

2014 International Conference on Computer and Communication Technology (ICCCT) • 2014
View 2 Excerpts

An offensive algorithm for multi-pattern parameterized string matching

2013 International Conference on Control, Computing, Communication and Materials (ICCCCM) • 2013
View 2 Excerpts

Improved bit-parallel string matching algorithm overcoming computer word size limitation

2012 1st International Conference on Recent Advances in Information Technology (RAIT) • 2012
View 1 Excerpt

Similar Papers

Loading similar papers…