Abstract
This paper defines a new string matching problem by combining two paradigms: function matching and δγ-matching. The result is an approximate variant of function matching where two equal-length strings X and Y match if there exists a function that maps X to a string X′ such that X′ and Y are δγ- similar. We propose an O(nm) algorithm for finding all the matches of a pattern P 1m in a text T 1n . © 2012 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Mendivelso, J., Lee, I., & Pinzón, Y. J. (2012). Approximate function matching under δ-and γ-distances. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7608 LNCS, pp. 348–359). Springer Verlag. https://doi.org/10.1007/978-3-642-34109-0_37
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
