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 …

Computing the distance between a given pattern of length n and a text of length m is defined
as calculating, for every m-substring of the text, the distance between the pattern and the …

Context-based modeling is an important step in high-performance lossless data
compression. To effectively define and utilize contexts for natural images is, however, a …

This paper presents a new approach for automatic concept extraction, using grammatical
parsers and Latent Semantic Analysis. The methodology is described, also the tool used to …

The algorithmic task of computing the Hamming distance between a given pattern of length
m and each location in a text of length n, both over a general alphabet\Sigma, is one of the …

We show, given a binary integer function diamond that is piecewise polynomial, that (+,
diamond) vector products are equivalent under one-to-polylog reductions to the computation …

We present new faster algorithms for the problems of δ and (δ, γ)-matching on numeric
strings. In both cases the running time of the proposed algorithms is shown to be O (δn log …

Abstract Given an alphabet Σ= 1, 2,…,| Σ| text string T∈ Σ n and a pattern string P∈ Σ m, for
each i= 1, 2,…, n− m+ 1 define L p (i) as the p-norm distance when the pattern is aligned …

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

Let a text string T= t0,…, tn− 1 and a pattern string P= p0,…, pm− 1, ti, pj∈ N be given. In the
Approximate Pattern Matching in theL1metric problem (L1-matching for short) the output is …