We consider string matching with variable length gaps. Given a string T and a pattern P
consisting of strings separated by variable length gaps (arbitrary strings of length in a …

Pattern matching (PM) with gap constraints (or flexible wildcards) is one of the essential
tasks in repetitive sequential pattern mining (or sequence pattern mining), since it can …

We consider the problem of indexing a string t of length n to report the occurrences of a
query pattern p containing m characters and j wildcards. Let occ be the number of …

The classic string indexing problem is to preprocess a string S into a compact data structure
that supports efficient pattern matching queries. Typical queries include existential queries …

Regular expression matching is a key task (and often computational bottleneck) in a variety
of software tools and applications. For instance, the standard grep and sed utilities, scripting …

We examine the complexity of the online Dictionary Matching with One Gap Problem
(DMOG) which is the following. Preprocess a dictionary D of d patterns, where each pattern …

Pattern matching with gap constraints is one of the essential problems in computer science
such as music information retrieval and sequential pattern mining. One of the cases is called …

We describe indexes for searching large data sets for variable-length-gapped (VLG)
patterns. VLG patterns are composed of two or more subpatterns, between each adjacent …

The classic string indexing problem is to preprocess a string S into a compact data structure
that supports efficient pattern matching queries. Typical queries include existential queries …

In the gapped string indexing problem, one is given a text T [1.. n] to preprocess. At query
time, a gapped pattern P= P 1 [α.. β] P 2 and an integer range [α.. β] are provided, where P 1 …