El. knyga: String Processing and Information Retrieval: 30th International Symposium, SPIRE 2023, Pisa, Italy, September 26-28, 2023, Proceedings

Longest Common Prefix Arrays for Succinct k-Spectra.- On Suffix Tree
Detection.- Optimally Computing Compressed Indexing Arrays Based on the
Compact Directed Acyclic Word Graph.- Evaluating Regular Path Queries on
Compressed Adjacency Matrices.- Approximate Cartesian Tree Matching: an
Approach Using Swaps.- Optimal Wheeler Language Recognition.- Approximation
and Fixed Parameter Algorithms for the Approximate Cover
Problem.- Approximation and Fixed Parameter Algorithms for the Approximate
Cover Problem.- Compressibility Measures for Two-dimensional Data.- From De
Bruijn Graphs to Variation Graphs - Relationships between Pangenome
Models.- CAGE: Cache-Aware Graphlet Enumeration.- Space-time Trade-offs for
the LCP Array of Wheeler DFAs.- Computing all-vs-all MEMs in
Grammar-compressed Text.- Sublinear Time Lempel-Ziv (LZ77)
Factorization.- New Advances in Rightmost Lempel-Ziv.- Engineering a Textbook
Approach to Index Massive String Dictionaries.- Count-min Sketch with
Variable Number of Hash Functions: an Experimental Study.- Dynamic Compact
Planar Embeddings.- A Simple Grammar-based Index for Finding Approximately
Longest Common Substrings.- On the Number of Factors in the LZ-End
Factorization.- Non-Overlapping Indexing in BWT-runs Bounded
Space.- Efficient Parameterized Pattern Matching in Sublinear Space.- Largest
Repetition Factorization of Fibonacci Words.- String Covers of a Tree
Revisited.- Compacting Massive Public Transport Data.- Constant Time and
Space Updates for the Sigma-Tau Problem.- Generalized Minimal Absent Words of
Multiple Strings.- Frequency-Constrained Substring Complexity.- Chaining of
Maximal Exact Matches in Graphs.- Algorithms and Hardness for the Longest
Common Subsequence of Three Strings and Related Problems.- Binary Mixed-digit
Data Compression Codes.