CAGE: Cache-Aware Graphlet Enumeration
|
2023 |
Conte, Alessio |
Sublinear Time Lempel-Ziv (LZ77) Factorization
|
2023 |
Ellert, Jonas |
Engineering a Textbook Approach to Index Massive String Dictionaries
|
2023 |
Ferragina, Paolo |
On the Number of Factors in the LZ-End Factorization
|
2023 |
Gawrychowski, Paweł |
Non-overlapping Indexing in BWT-Runs Bounded Space
|
2023 |
Gibney, Daniel |
Constant Time and Space Updates for the Sigma-Tau Problem
|
2023 |
Lipták, Zsuzsanna |
Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph
|
2023 |
Arimura, Hiroki |
Evaluating Regular Path Queries on Compressed Adjacency Matrices
|
2023 |
Arroyuelo, Diego |
From de Bruijn Graphs to Variation Graphs – Relationships Between Pangenome Models
|
2023 |
Cicherski, Adam |
Computing All-vs-All MEMs in Grammar-Compressed Text
|
2023 |
Díaz-Domínguez, Diego |
Largest Repetition Factorization of Fibonacci Words
|
2023 |
Kishi, Kaisei |
Efficient Parameterized Pattern Matching in Sublinear Space
|
2023 |
Ideguchi, Haruki |
Chaining of Maximal Exact Matches in Graphs
|
2023 |
Rizzo, Nicola |
Algorithms and Hardness for the Longest Common Subsequence of Three Strings and Related Problems
|
2023 |
Wang, Lusheng |
Optimal Wheeler Language Recognition
|
2023 |
Becker, Ruben |
Approximate Cartesian Tree Matching: An Approach Using Swaps
|
2023 |
Auvray, Bastien |
Data Structures for SMEM-Finding in the PBWT
|
2023 |
Bonizzoni, Paola |
Dynamic Compact Planar Embeddings
|
2023 |
Gagie, Travis |
A Simple Grammar-Based Index for Finding Approximately Longest Common Substrings
|
2023 |
Gagie, Travis |
Frequency-Constrained Substring Complexity
|
2023 |
Pissis, Solon P. |