δγ – Parameterized Matching

Order-preserving matching

“…For example, when AC-Order-Matcher-Multiple reaches state q 3 of Fig. 6 after reading the first three characters from the text (20,30,10,15), T contains {20, 30, 10} that is the prefix of the text represented by q 3 . As there is no forward transition from q 3 that matches the rank 2 of the next character 15, the state is changed to q 1 by following the failure transition.…”

“…Related Work: (δ, γ)-matching has been studied to search for similar patterns of numeric strings [8,15,12,11,19,20,21]. In this paradigm, two parameters δ and γ are given, and two numeric strings of the same length are matched if the maximum difference of the corresponding characters is at most δ and the total sum of differences is at most γ.…”

Order-preserving pattern matching indeterminate strings

“…In norm matching [7,44,1,47], matches between numeric strings occur if a given distance threshold f (x, y)≤θ is satisfied. In (δ,γ)-matching [14,26,24,23,42,43,45], strings are matched if the maximum difference of the corresponding characters is at most δ and the sum of differences is at most γ.…”

A General Approach to Uniformly Handle Different String Metrics Based on Heterogeneous Alphabets

“…This metric has found interesting applications in bioinformatics [27] and music information retrieval [30]. In [39], a parameterized version of the δγ distance has been presented. In the context of parameterized Edit/Hamming distance, this problem has been stated as the identification of a proper transformation script allowing a parameterized string to be obtained from another.…”