research
∙
06/03/2021
Position Heaps for Cartesian-tree Matching on Strings and Tries
The Cartesian-tree pattern matching is a recently introduced scheme of p...
share
research
∙
12/18/2020
The Parameterized Suffix Tray
Let Σ and Π be disjoint alphabets, respectively called the static alphab...
research
∙
02/17/2020
DAWGs for parameterized matching: online construction and related indexing structures
Two strings x and y over Σ∪Π of equal length are said to parameterized m...
research
∙
06/03/2019
Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets
We present the first worst-case linear time algorithm that directly comp...
research
∙
03/14/2019
The Parameterized Position Heap of a Trie
Let Σ and Π be disjoint alphabets of respective size σ and π. Two string...
research
∙
08/03/2018
