A pattern α, ie, a string that contains variables and terminals, matches a terminal word w if w
can be obtained by uniformly substituting the variables of α by terminal words. Deciding …

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 …

Given a source string u and a target string w, to decide whether w can be obtained by
applying a string morphism on u (ie, uniformly replacing the symbols in u by strings) …

Parameterized pattern matching is a string searching variant that was initially defined to
detect duplicate code but later proved to support several other applications. In particular, two …

We present problems in different application areas: tandem repeats (computational biology),
poetry and music analysis, and author validation, that require a more sophisticated pattern …

Two equal length strings s and s′, over alphabets Σ s and Σ s′, parameterize match if
there exists a bijection π: Σ s→ Σ s′ such that π (s)= s′, where π (s) is the renaming of …

Historically, approximate pattern matching has mainly focused at coping with errors in the
data, while the order of the text/pattern was assumed to be more or less correct. In this paper …

A pattern is a string consisting of variables and terminal symbols, and its language is the set
of all words that can be obtained by substituting arbitrary words for the variables. The …

In many pattern matching applications the text has some properties attached to its various
parts. Pattern Matching with Properties (Property Matching, for short), involves a string …

We consider the suffix array for parameterized binary strings that consist of only two types of
parameter symbols. We show that the parameterized suffix array, as well as its longest …