| 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 |
| 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. |
| Linear-Time Computation of Generalized Minimal Absent Words for Multiple Strings
|
2023 |
Okabe, Kouta |
| 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 |
Tag hinzufügen