| 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 |
| Longest Common Prefix Arrays for Succinct k-Spectra
|
2023 |
Alanko, Jarno N. |
| On Suffix Tree Detection
|
2023 |
Amir, Amihood |
| Compressibility Measures for Two-Dimensional Data
|
2023 |
Carfagna, Lorenzo |
| Approximation and Fixed Parameter Algorithms for the Approximate Cover Problem
|
2023 |
Blin, Guillaume |
| Space-Time Trade-Offs for the LCP Array of Wheeler DFAs
|
2023 |
Cotumaccio, Nicola |
| New Advances in Rightmost Lempel-Ziv
|
2023 |
Ellert, Jonas |
| Count-Min Sketch with Variable Number of Hash Functions: An Experimental Study
|
2023 |
Fusy, Éric |
| String Covers of a Tree Revisited
|
2023 |
Kondraciuk, Łukasz |
| Compacting Massive Public Transport Data
|
2023 |
Letelier, Benjamín |
| Binary Mixed-Digit Data Compression Codes
|
2023 |
Zavadskyi, Igor |
| 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 |
Tag hinzufügen