| 2023 | Approximate Cartesian Tree Matching: An Approach Using Swaps. | Bastien Auvray, Julien David, Richard Groult, Thierry Lecroq |
| 2023 | Evaluating Regular Path Queries on Compressed Adjacency Matrices. | Diego Arroyuelo, Adrin Gmez-Brandn, Gonzalo Navarro |
| 2023 | Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph. | Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima, Mizuki Sue |
| 2023 | On Suffix Tree Detection. | Amihood Amir, Eitan Kondratovsky, Avivit Levy |
| 2023 | Longest Common Prefix Arrays for Succinct k-Spectra. | Jarno N. Alanko, Elena Biagi, Simon J. Puglisi |
| 2022 | Genome Comparison on Succinct Colored de Bruijn Graphs. | Lucas P. Ramos, Felipe A. Louza, Guilherme P. Telles |
| 2022 | On the Optimisation of the GSACA Suffix Array Construction Algorithm. | Jannik Olbrich, Enno Ohlebusch, Thomas Bchler |
| 2022 | Balancing Run-Length Straight-Line Programs. | Gonzalo Navarro, Francisco Olivares, Cristian Urbina |
| 2022 | Online Algorithms for Finding Distinct Substrings with Length and Multiple Prefix and Suffix Conditions. | Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno |
| 2022 | Engineering Compact Data Structures for Rank and Select Queries on Bit Vectors. | Florian Kurpicz |
| 2022 | Substring Complexities on Run-Length Compressed Strings. | Akiyoshi Kawamoto, Tomohiro I |
| 2022 | Computing the Parameterized Burrows-Wheeler Transform Online. | Daiki Hashimoto, Diptarama Hendrian, Dominik Kppl, Ryo Yoshinaka, Ayumi Shinohara |
| 2022 | Pattern Matching Under DTW Distance. | Garance Gourdel, Anne Driemel, Pierre Peterlongo, Tatiana Starikovskaya |
| 2022 | Matching Patterns with Variables Under Edit Distance. | Pawel Gawrychowski, Florin Manea, Stefan Siemer |
| 2022 | KATKA: A KRAKEN-Like Tool with k Given at Query Time. | Travis Gagie, Sana Kashgouli, Ben Langmead |
| 2022 | On Representing the Degree Sequences of Sublogarithmic-Degree Wheeler Graphs. | Travis Gagie |
| 2022 | How Train-Test Leakage Affects Zero-Shot Retrieval. | Maik Frbe, Christopher Akiki, Martin Potthast, Matthias Hagen |
| 2022 | Sorting Genomes by Prefix Double-Cut-and-Joins. | Guillaume Fertin, Graldine Jean, Anthony Labarre |
| 2022 | Computing All-vs-All MEMs in Run-Length-Encoded Collections of HiFi Reads. | Diego Daz-Domnguez, Simon J. Puglisi, Leena Salmela |
| 2022 | Internal Masked Prefix Sums and Its Connection to Fully Internal Measurement Queries. | Rathish Das, Meng He, Eitan Kondratovsky, J. Ian Munro, Kaiyu Wu |
| 2022 | Quantum Time Complexity and Algorithms for Pattern Matching on Labeled Graphs. | Parisa Darbari, Daniel Gibney, Sharma V. Thankachan |
| 2022 | On the Hardness of Computing the Edit Distance of Shallow Trees. | Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann |
| 2022 | Subsequence Covers of Words. | Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
| 2022 | Accessing the Suffix Array via φ | Christina Boucher, Dominik Kppl, Herman Perera, Massimiliano Rossi |
| 2022 | Compressed String Dictionaries via Data-Aware Subtrie Compaction. | Antonio Boffa, Paolo Ferragina, Francesco Tosoni, Giorgio Vinciguerra |