This article focuses on the introduction of control, authoring, and composition in human-
computer music improvisation through the description of a guided music generation model …

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 …

Given a text T and a pattern P, the order-preserving pattern matching (OPPM for short)
problem is to find all substrings of T which have the same relative orders as P. Recently …

String matching is one of the oldest algorithmic techniques, yet still one of the most
pervasive in computer science. The past 20 years have seen technological leaps in …

We introduce a new metric of match, called Cartesian tree matching, which means that two
strings match if they have the same Cartesian trees. Based on Cartesian tree matching, we …

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 …