Accepted Papers

Long Papers

1. Taiki Kaneda, Hiroki Arimura and Shunsuke Inenaga. Fully Persistent Dynamic LCE via AVL Trees and AVL Grammars

2. Michael Goodrich, Gonzalo Navarro and Claire To. Simple Low-Overhead Communication-Efficient String Reconciliation and Edit Distance

3. Haruki Umezaki, Hiroki Shibata, Yuto Nakashima and Shunsuke Inenaga. Compact Enumeration of Maximal Closed Substrings in Run-Length Encoded Strings

4. Naor Dahan, Matan Kraus, Avivit Levy, Ely Porat, B. Riva Shalom and Sharma V. Thankachan. Sketching Burst Hamming Distance

5. Shizuya Ito, Ryo Yoshinaka and Ayumi Shinohara. Linear-Time Reverse Engineering of Linear-Size Suffix Tries

6. Hiroki Shibata, Haruki Umezaki, Takuya Mieno, Yuto Nakashima and Shunsuke Inenaga. Online computation of maximal closed substrings

7. Mingyang Gong, Adiesha Liyanage, Braeden Sopp and Binhai Zhu. Computing Maximal Repeating Subsequences in a String

8. Gonzalo Navarro and Francisco Olivares. Optimal-Time Contextual Pattern Matching in Compressed Space

9. Francisco Olivares and Gonzalo Navarro. Practical Linear-Time Computation of Smallest Suffixient Sets

10. Hiroto Fujimaru, Gonzalo Navarro, Francisco Olivares, Jakub Radoszewski, Giuseppe Romana and Cristian Urbina. Computing Smallest Suffixient Arrays in Sublinear Time

11. Andrzej Stalke. Parameterized Complexity of k–Pseudoperiodicity

12. Gabriel Carmona, Susana Ladra, Hilda Romero-Velo and Fernando Silva-Coira. Contour-Based Motif Discovery via the Cartesian tree BWT Index

13. Philip Bille, Johannes Fischer, Inge Li Gørtz and Filippo Lari. Average-Case Optimal Encodings and Efficient Worst-Case Indices for Element Distinctness Queries

14. Rikuya Hamai, Yuto Nakashima and Shunsuke Inenaga. The parameterized periodicity lemma

15. Philip Bille, Gabriel Carmona and Inge Li Gørtz. k^2-octopus: An adaptive data structure for binary matrices

16. Lucas Oliveira and João Meidanis. Fast computation of specific words and matching statistics in CDAWG space

17. William T. Doan, Daniel Gibney and Jackson Huffstutler. Inverse String Folding with Minimum Crease Complexity

18. Paola Bonizzoni, Travis Gagie and Younan Gao. Faster Iterative \phi Queries on the Positional BWT

19. Arseny Shur, Ido Tziony and Yaron Orenstein. Generating Minimum-Density Minimizers

Short Papers

20. Sharma V. Thankachan, Paniz Abedin and Arghya Kusum Das. Longest Common Substring After k Edits in Compact Space

21. Máximo Pérez López, Philip Bille, Inge Li Gørtz and Simon R. Tarnow. Tighter Bounds for Wheeler Determinization

22. Lorenzo Carfagna and Giovanni Manzini. Solving Square-Submatrix Equation Systems

23. Yoann Dufresne and Francesco Andreace. Binary search and and set operations on compacted k-mer lists