Abstract is missing.
- Longest Common Prefix Arrays for Succinct k-SpectraJarno N. Alanko, Elena Biagi 0002, Simon J. Puglisi. 1-13 [doi]
- On Suffix Tree DetectionAmihood Amir, Eitan Kondratovsky, Avivit Levy. 14-27 [doi]
- Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word GraphHiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima, Mizuki Sue. 28-34 [doi]
- Evaluating Regular Path Queries on Compressed Adjacency MatricesDiego Arroyuelo, Adrián Gómez-Brandón, Gonzalo Navarro. 35-48 [doi]
- Approximate Cartesian Tree Matching: An Approach Using SwapsBastien Auvray, Julien David, Richard Groult, Thierry Lecroq. 49-61 [doi]
- Optimal Wheeler Language RecognitionRuben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Alberto Policriti, Nicola Prezza. 62-74 [doi]
- Approximation and Fixed Parameter Algorithms for the Approximate Cover ProblemGuillaume Blin, Alexandru Popa 0001, Mathieu Raffinot, Raluca Uricaru. 75-88 [doi]
- Data Structures for SMEM-Finding in the PBWTPaola Bonizzoni, Christina Boucher, Davide Cozzi, Travis Gagie, Dominik Köppl, Massimiliano Rossi 0001. 89-101 [doi]
- Compressibility Measures for Two-Dimensional DataLorenzo Carfagna, Giovanni Manzini. 102-113 [doi]
- From de Bruijn Graphs to Variation Graphs - Relationships Between Pangenome ModelsAdam Cicherski, Norbert Dojer. 114-128 [doi]
- CAGE: Cache-Aware Graphlet EnumerationAlessio Conte, Roberto Grossi, Davide Rucci. 129-142 [doi]
- Space-Time Trade-Offs for the LCP Array of Wheeler DFAsNicola Cotumaccio, Travis Gagie, Dominik Köppl, Nicola Prezza. 143-156 [doi]
- Computing All-vs-All MEMs in Grammar-Compressed TextDiego Díaz-Domínguez, Leena Salmela. 157-170 [doi]
- Sublinear Time Lempel-Ziv (LZ77) FactorizationJonas Ellert. 171-187 [doi]
- New Advances in Rightmost Lempel-ZivJonas Ellert, Johannes Fischer 0001, Max Rishøj Pedersen. 188-202 [doi]
- Engineering a Textbook Approach to Index Massive String DictionariesPaolo Ferragina, Mariagiovanna Rotundo, Giorgio Vinciguerra. 203-217 [doi]
- Count-Min Sketch with Variable Number of Hash Functions: An Experimental StudyÉric Fusy, Gregory Kucherov. 218-232 [doi]
- Dynamic Compact Planar EmbeddingsTravis Gagie, Meng He 0001, Michael St Denis. 233-245 [doi]
- A Simple Grammar-Based Index for Finding Approximately Longest Common SubstringsTravis Gagie, Sana Kashgouli, Gonzalo Navarro. 246-252 [doi]
- On the Number of Factors in the LZ-End FactorizationPawel Gawrychowski, Maria Kosche, Florin Manea. 253-259 [doi]
- Non-overlapping Indexing in BWT-Runs Bounded SpaceDaniel Gibney, Paul Macnichol, Sharma V. Thankachan. 260-270 [doi]
- Efficient Parameterized Pattern Matching in Sublinear SpaceHaruki Ideguchi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara. 271-283 [doi]
- Largest Repetition Factorization of Fibonacci WordsKaisei Kishi, Yuto Nakashima, Shunsuke Inenaga. 284-296 [doi]
- String Covers of a Tree RevisitedLukasz Kondraciuk. 297-309 [doi]
- Compacting Massive Public Transport DataBenjamín Letelier, Nieves R. Brisaboa, Pablo Gutiérrez-Asorey, José R. Paramá, Tirso V. Rodeiro. 310-322 [doi]
- Constant Time and Space Updates for the Sigma-Tau ProblemZsuzsanna Lipták, Francesco Masillo, Gonzalo Navarro, Aaron Williams. 323-330 [doi]
- Linear-Time Computation of Generalized Minimal Absent Words for Multiple StringsKouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai. 331-344 [doi]
- Frequency-Constrained Substring ComplexitySolon P. Pissis, Michael Shekelyan, Chang Liu, Grigorios Loukides. 345-352 [doi]
- Chaining of Maximal Exact Matches in GraphsNicola Rizzo 0001, Manuel Cáceres, Veli Mäkinen. 353-366 [doi]
- Algorithms and Hardness for the Longest Common Subsequence of Three Strings and Related ProblemsLusheng Wang 0001, Binhai Zhu. 367-380 [doi]
- Binary Mixed-Digit Data Compression CodesIgor O. Zavadskyi, Maksym Kovalchuk. 381-392 [doi]