String Processing and Information Retrieval

This book constitutes the refereed proceedings of the 31st International Symposium on String Processing and Information Retrieval, SPIRE 2024, held in Puerto Vallarta, Mexico, during September 2325, 2024.

The 22 full papers and 4 short papers presented in this volume were carefully reviewed and selected from 41 submissions. The papers reflect the continuation of the long and well-established tradition of encouraging high-quality research at the broad nexus of string processing, information retrieval, and computational biology.

Inhalt

.- Linear Time Reconstruction of Parameterized Strings from Parameterized Suffix and LCP Arrays for Constant-Sized Alphabets.
.- Bijective BWT based Compression Schemes.
.- Indexing Finite-State Automata Using Forward-Stable Partitions.
.- Burst Edit Distance.
.- Generalization of Repetitiveness Measures for Two-Dimensional Strings.
.- On Computing the Smallest Suffixient Set.
.- Revisiting the Folklore Algorithm for Random Access to Grammar- Compressed Strings.
.- Logarithmic-Time Internal Pattern Matching Queries in Compressed and Dynamic Texts.
.- Bounded-Ratio Gapped String Indexing.
.- Simultaneously Building and Reconciling a Synteny Tree.
.- Quantum Algorithms for Longest Common Substring with a Gap.
.- Online Computation of String Net Frequency.
.- On the Number of Non-equivalent Parameterized Squares in a String.
.- Another virtue of wavelet forests.
.- All-Pairs Suffix-Prefix on Dynamic Set of Strings.
.- Adaptive Dynamic Bitvectors.
.- Compressed Graph Representations for Evaluating Regular Path Queries.
.- Greedy Conjecture for the Shortest Common Superstring Problem and its Strengthenings.
.- Faster computation of Chinese frequent strings and their net frequencies.
.- Faster Algorithms for Ranking/Unranking Bordered and Unbordered Words.
.- Computing String Covers in Sublinear Time.
.- LZ78 Substring Compression with CDAWGs.
.- 2d Side-Sharing Tandems with Mismatches.
.- Faster and simpler online/sliding rightmost Lempel-Ziv factorizations.
.- Space-efficient SLP Encoding for O(log N)-time Random Access.
.- Simple Linear-time Repetition Factorization.