Traditional sequential pattern mining methods were designed for symbolic sequence. As a
collection of measurements in chronological order, a time series needs to be discretized into …

Given a text T and a pattern P, the order-preserving pattern matching (OPPM) problem is to
find all substrings in T which have the same relative orders as P. The OPPM has been …

Jumbled indexing is the problem of indexing a text T for queries that ask whether there is a
substring of T matching a pattern represented as a Parikh vector, ie, the vector of frequency …

The problem of order-preserving matching has gained attention lately. The text and the
pattern consist of numbers. The task is to find all the substrings in the text which have the …

We consider a generalization of the recently introduced order-preserving pattern matching.
The difference between the standard pattern matching and the order-preserving variant is …

The fields of succinct data structures and compressed text indexing have seen quite a bit of
progress over the last two decades. An important achievement, primarily using techniques …

Order-preserving matching is a string matching problem of two numeric strings where the
relative orders of consecutive substrings are matched instead of the characters themselves …

The problem of order-preserving matching has gained attention lately. The text and the
pattern consist of numbers. The task is to find all substrings in the text which have the same …

Given a pattern x of length m and a text y of length n, both over an ordered alphabet, the
order-preserving pattern matching problem consists in finding all substrings of the text with …

The problem of order-preserving matching is to find all substrings in the text which have the
same relative order and length as the pattern. Several online and one offline solution were …