Abstract
This paper defines a new pattern matching problem by combining two paradigms: δγ-matching and parameterized matching. The solution is essentially obtained by a combination of bitparallel techniques and a reduction to a graph matching problem. The time complexity of the algorithm is O(nm), assuming text size n, pattern size m and a constant size alphabet. © 2009 Springer Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Lee, I., Mendivelso, J., & Pinzón, Y. J. (2008). δγ - Parameterized matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5280 LNCS, pp. 236–248). Springer Verlag. https://doi.org/10.1007/978-3-540-89097-3_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
