Jump-matching with errors

Two equal-length integer-value strings jump-match if each of their corresponding (locationwise) elements differ by the same value d. In Jump matching one seeks all text substrings which jump-match the pattern. Strings approximate jump-match if all elements differ by the same value asides from at mostk, where k is predefined. In approximate jump-matching one seeks the text substrings which approximate jump-match with the pattern. We present innovative, efficient deterministic and randomized algorithms to solve the approximate jump-matching problem.