We introduce a new string matching problem called order-preserving matching on numeric
strings, where a pattern matches a text if the text contains a substring of values whose …

We develop efficient dynamic programming algorithms for pattern matching with general
gaps and character classes. We consider patterns of the form p 0 g (a 0, b 0) p 1 g (a 1, b …

This paper defines a new pattern matching problem by combining two paradigms: δγ–
matching and parameterized matching. The solution is essentially obtained by a …

It has been twenty years since the publication of the two seminal papers of Baeza-Yates and
Gonnet and of Wu and Manber in the September 1992 issue of the Communications of the …

We present a very efficient variant of the (δ, α)-SEQUENTIAL-SAMPLING algorithm, recently
introduced by the authors, for the δ-approximate string matching problem with α-bounded …

Given an indeterminate string pattern p and an indeterminate string text t, the problem of
order-preserving pattern matching with character uncertainties (muOPPM) is to find all …

We consider the following string matching problem. Pattern p 0 p 1 p 2... pm−− 1 (δ, α)-
matches the text substring t_i_0t_i_1t_i_2...t_i_m-1, if |p_j-t_i_j|≦δ for j∈ 0,..., m–1, where …

We develop efficient dynamic programming algorithms for a pattern matching with general
gaps and character classes. We consider patterns of the form p 0 g (a 0, b 0) p 1 g (a 1, b …

We propose new algorithms for (δ, γ, α)-matching. In this string matching problem we are
given a pattern P= p0p1… pm− 1 and a text T= t0t1… tn− 1 over some integer alphabet …

Given a pattern p of size m and a text t, the problem of order-preserving pattern matching
(OPPM) is to find all substrings of t that satisfy one of the orderings defined by p. This …