Approximate Function Matching under δ- and γ- Distances (original) (raw)

Lecture Notes in Computer Science, 2012

Abstract

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 P1 …m in a text T1 …n.

Inbok Lee hasn't uploaded this paper.

Let Inbok know you want this paper to be uploaded.

Ask for this paper to be uploaded.