1 |
Dynamic Suffix Array with Polylogarithmic Queries and Updates ...
|
|
|
|
BASE
|
|
Show details
|
|
3 |
Breaking the $O(n)$-Barrier in the Construction of Compressed Suffix Arrays ...
|
|
|
|
BASE
|
|
Show details
|
|
5 |
Time-Space Tradeoffs for Finding a Long Common Substring ...
|
|
|
|
BASE
|
|
Show details
|
|
6 |
Time-Space Tradeoffs for Finding a Long Common Substring ...
|
|
|
|
BASE
|
|
Show details
|
|
7 |
Practical Performance of Space Efficient Data Structures for Longest Common Extensions ...
|
|
|
|
BASE
|
|
Show details
|
|
9 |
Longest Unbordered Factor in Quasilinear Time
|
|
Kociumaka, Tomasz; Kundu, Ritu; Mohamed, Manal. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. : LIPIcs - Leibniz International Proceedings in Informatics. 29th International Symposium on Algorithms and Computation (ISAAC 2018), 2018
|
|
BASE
|
|
Show details
|
|
13 |
Efficient Index for Weighted Sequences
|
|
Barton, Carl; Kociumaka, Tomasz; Pissis, Solon P.. - : 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
|
|
14 |
Minimal Suffix and Rotation of a Substring in Optimal Time
|
|
Kociumaka, Tomasz. - : 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 |
Minimal Suffix and Rotation of a Substring in Optimal Time ...
|
|
Kociumaka, Tomasz. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany, 2016
|
|
BASE
|
|
Show details
|
|
16 |
Sparse Suffix Tree Construction in Optimal Time and Space ...
|
|
|
|
BASE
|
|
Show details
|
|
17 |
Minimal Suffix and Rotation of a Substring in Optimal Time ...
|
|
|
|
BASE
|
|
Show details
|
|
|
|