Titlebook: Combinatorial Pattern Matching; 25th Annual Symposiu Alexander S. Kulikov,Sergei O. Kuznetsov,Pavel Pev Conference proceedings 2014 Springe

Kidney-Failure

Dictionary Matching with One Gap,s a sequence of subpatterns separated by bounded sequences of don’t cares. Then, given a query text . of length . over alphabet Σ, the goal is to output all locations in . in which a pattern .. ∈ ., 1 ≤ . ≤ ., ends. There is a renewed current interest in the gapped matching problem stemming from cyb

吃掉

cleaver

Computing Minimal and Maximal Suffixes of a Substring Revisited,, Kolesnichenko and Starikovskaya [CPM’13]. For the minimal suffix problem we show that for any 1 ≤ . ≤ log. there exists a linear-space data structure with . query time and . preprocessing time. As a sample application, we show that this data structure can be used to compute the Lyndon decompositio

Encoding

Comprise