Recently, Conte et al. generalized the longest-common prefix (LCP) array...
In the past thirty years, numerous algorithms for building the suffix ar...
Matching statistics were introduced to solve the approximate string matc...
In the present work, we lay out a new theory showing that all automata c...
For the first time we provide a succinct pattern matching index for arbi...
Wheeler DFAs (WDFAs) are a sub-class of finite-state automata which is
p...
The states of a deterministic finite automaton A can be identified with
...
In the present work, we study the hierarchy of p-sortable languages:
reg...
An index for a finite automaton is a powerful data structure that suppor...