String Processing and Information Retrieval

32nd International Symposium, SPIRE 2025, London, UK, September 8-11, 2025, Proceedings
Erscheinungsjahr 2025
ISBN: 978-3-032-05227-8
Verlag: Springer

Buch, Englisch, 306 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 499 g

Reihe: Lecture Notes in Computer Science

This book constitutes the refereed proceedings of the 32nd International Symposium on String Processing and Information Retrieval, SPIRE 2025, held in London, UK, during September 8-11, 2025.

The 17 full papers and 6 short papers included in this book were carefully reviewed and selected from 42 submissions. These papers cover research in all aspects of string processing, information retrieval, computational biology, and related applications. 

Zielgruppe

Research

Autoren/Hrsg.

Badkobeh, Golnaz

Radoszewski, Jakub

Tonellotto, Nicola

Baeza-Yates, Ricardo

Fachgebiete

• Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
• Mathematik | Informatik EDV | Informatik Technische Informatik
• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen
• Interdisziplinäres Wissenschaften Wissenschaften: Forschung und Information Informationstheorie, Kodierungstheorie
• Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Numerische Mathematik
• Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz

Inhaltsverzeichnis

.- New perspectives on the Burrows–Wheeler Transform (Keynote).

.- Scaling genomic reuse: hypothesis and algorithms for k-mer collections (Keynote).

.- Succinct Dynamic Data Structures (25 years on) (Keynote).

.- Testing Quasiperiodicity.

.- KeBaB: k-mer based breaking for finding long MEMs.

.- Analysing New Entropy Measures for Tries.

.- Depth first representations of kˆ2-trees.

.- Dorst–Smeulders Coding for Arbitrary Binary Words.

.- Prefix-free parsing for merging big BWTs.

.- RLZ-r and LZ-End-r: Enhancing Move-r.

.- Massively Parallel Computation of Matching Statistics.

.- Cache-Friendly Compressed Boolean Matrices.

.- Tight Additive Sensitivity on LZ-style Compressors and String Attractors.

.- On the number of MUSs crossing a position.

.- String Consensus Problems with Swaps and Substitutions.

.- Two-Player Communication Complexity of Pattern Matching.

.- REINDEER2: practical abundance index at scale.

.- Efficient Computation of Closed Substrings.

.- Nyldon Factorization of Thue-Morse Words and Fibonacci Words.

.- String Matching with a Dynamic Pattern.

.- Smallest Suffixient Sets as a Repetitiveness Measure.

.- Longest Unbordered Factors on Run-Length Encoded Strings.

.- Longest Common Subsequence in k-length substrings for Run-Length-Encoded strings.

.- Practical algorithms for Hierarchical Overlap Graphs.

.- Counting distinct (non-)crossing substrings.

.- Faster Algorithm for Bounded Damerau–Levenshtein Distance.