2 |
DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures
|
|
|
|
BASE
|
|
Show details
|
|
4 |
DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures ...
|
|
|
|
BASE
|
|
Show details
|
|
5 |
DAWGs for parameterized matching: online construction and related indexing structures ...
|
|
|
|
BASE
|
|
Show details
|
|
6 |
An Improved Data Structure for Left-Right Maximal Generic Words Problem
|
|
Fujishige, Yuta; Nakashima, Yuto; Inenaga, Shunsuke. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. : LIPIcs - Leibniz International Proceedings in Informatics. 30th International Symposium on Algorithms and Computation (ISAAC 2019), 2019
|
|
BASE
|
|
Show details
|
|
7 |
Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time ...
|
|
|
|
BASE
|
|
Show details
|
|
8 |
Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets ...
|
|
|
|
BASE
|
|
Show details
|
|
10 |
Computing All Distinct Squares in Linear Time for Integer Alphabets
|
|
Bannai, Hideo; Inenaga, Shunsuke. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. : LIPIcs - Leibniz International Proceedings in Informatics. 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), 2017
|
|
BASE
|
|
Show details
|
|
11 |
Small-space encoding LCE data structure with constant-time queries ...
|
|
|
|
BASE
|
|
Show details
|
|
12 |
Small-Space LCE Data Structure with Constant-Time Queries ...
|
|
|
|
BASE
|
|
Show details
|
|
13 |
Computing All Distinct Squares in Linear Time for Integer Alphabets ...
|
|
|
|
BASE
|
|
Show details
|
|
14 |
Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction
|
|
Tanimura, Yuka; I, Tomohiro; Bannai, Hideo. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. : LIPIcs - Leibniz International Proceedings in Informatics. 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), 2016
|
|
BASE
|
|
Show details
|
|
15 |
Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets ...
|
|
|
|
BASE
|
|
Show details
|
|
16 |
Fully Dynamic Data Structure for LCE Queries in Compressed Space ...
|
|
|
|
BASE
|
|
Show details
|
|
17 |
Fully dynamic data structure for LCE queries in compressed space ...
|
|
|
|
BASE
|
|
Show details
|
|
18 |
Computing All Distinct Squares in Linear Time for Integer Alphabets ...
|
|
|
|
BASE
|
|
Show details
|
|
19 |
Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction ...
|
|
|
|
BASE
|
|
Show details
|
|
20 |
Deterministic sub-linear space LCE data structures with efficient construction ...
|
|
|
|
BASE
|
|
Show details
|
|
|
|