| r-Indexing the eBWT
|
2021 |
Boucher, Christina |
| Minimal Unique Palindromic Substrings After Single-Character Substitution
|
2021 |
Funakoshi, Mitsuru |
| Longest Common Rollercoasters
|
2021 |
Fujita, Kosuke |
| Extracting the Sparse Longest Common Prefix Array from the Suffix Binary Search Tree
|
2021 |
LI, Tomohiro |
| Position Heaps for Cartesian-Tree Matching on Strings and Tries
|
2021 |
Nishimoto, Akio |
| Unicode at Gigabytes per Second
|
2021 |
Lemire, Daniel |
| String Covers of a Tree
|
2021 |
Radoszewski, Jakub |
| A Separation of y and b via Thue-Morse Words
|
2021 |
Bannai, Hideo |
| Improved Topic Modeling in Twitter Through Community Pooling
|
2021 |
Albanese, Federico |
| Permutation-Constrained Common String Partitions with Applications
|
2021 |
Lafond, Manuel |
| All Instantiations of the Greedy Algorithm for the Shortest Common Superstring Problem are Equivalent
|
2021 |
Nikolaev, Maksim S. |
| On the Approximation Ratio of LZ-End to LZ77
|
2021 |
Ideue, Takumi |
| Lower Bounds for the Number of Repetitions in 2D Strings
|
2021 |
Gawrychowski, Pawet |
| Exploiting Pseudo-locality of Interchange Distance
|
2021 |
Levy, Avivit |
| TSXor: A Simple Time Series Compression Algorithm
|
2021 |
Bruno, Andrea |
| An LMS-Based Grammar Self-index with Local Consistency Properties
|
2021 |
Díaz-Dominguez, Diego |
| Grammar Index by Induced Suffix Sorting
|
2021 |
Akagi, Tooru |
| Computing the Original eBWT Faster, Simpler, and with Less Memory
|
2021 |
Boucher, Christina |
| findere: Fast and Precise Approximate Membership Query
|
2021 |
Robidou, Lucas |
| On Stricter Reachable Repetitiveness Measures
|
2021 |
Navarro, Gonzalo |
Tag hinzufügen