String processing and information retrieval [electronic resource] : 29th international symposium, SPIRE 2022, Concepción, Chile, November 8-10, 2022, proceedings / Diego Arroyuelo, Barbara Poblete (eds.).

String Algorithms
Subsequence Covers of Words
Maximal Closed Substrings
Online Algorithms for Finding Distinct Substrings with Length and Multiple Prefix and Suffx Conditions
The Complexity of the Co-Occurrence Problem
Reconstructing Parameterized Strings from Parameterized Suffx and LCP Arrays
Computing the Parameterized BurrowsWheeler Transform Online
Accessing the Suffx Array via 1 Forest
On the Optimisation of the GSACA Suffx Array Construction Algorithm
String Compression
Balancing Run-Length Straight-Line Programs
Substring Complexities on Run-length Compressed Strings
Information Retrieval
How TrainTest Leakage Affects Zero-shot Retrieval
Computational Biology
Genome Comparison on Succinct Colored de Bruijn Graphs
Sorting Genomes by Prefix Double-Cut-and-Joins
KATKA: A KRAKEN-like Tool with k Given at Query Time
Computing all-vs-all MEMs in Run-Length-Encoded Collections of HiFi Reads
Space-Effcient Data Structures
Internal Masked Prefix Sums and Its Connection to Fully Internal Measurement Queries
Compressed String Dictionaries via Data-Aware Subtrie Compaction
On representing the Degree Sequences of Sublogarithmic-Degree Wheeler Graphs
Engineering Compact Data Structures for Rank and Select Queries on Bit Vectors
Pattern Matching in Strings, Graphs, and Trees
Matching Patterns with Variables Under Edit Distance
On the Hardness of Computing the Edit Distance of Shallow Trees
Quantum Time Complexity and Algorithms for Pattern Matching on Labeled Graphs
Pattern Matching under DTW Distance.