String Processing and Information Retrieval

32nd International Symposium, SPIRE 2025, London, UK, September 8–11, 2025, Proceedings

Golnaz Badkobeh, Jakub Radoszewski, Nicola Tonellotto, Ricardo Baeza-Yates (Herausgeber)

Buch | Softcover

XX, 306 Seiten

2025
Springer International Publishing (Verlag)
978-3-032-05227-8 (ISBN)

Artikel merken

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.

.- 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.

Erscheinungsdatum	23.09.2025
Reihe/Serie	Lecture Notes in Computer Science
Zusatzinfo	XX, 306 p. 73 illus., 44 illus. in color.
Verlagsort	Cham
Sprache	englisch
Maße	155 x 235 mm
Themenwelt	Informatik ► Theorie / Studium ► Algorithmen
Themenwelt	Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik
Schlagworte	algorithms for DNA sequencing • automata based string processing • Combinatorics on Words • compressed data structures • compressed string processing • Computational Biology • data structures for string processing • Genome Rearrangements • Information Retrieval • motif finding • Pangenomics • Pattern Matching • Phylogenetics • string processing • text compression • text indexing • Text Mining
ISBN-10	3-032-05227-0 / 3032052270
ISBN-13	978-3-032-05227-8 / 9783032052278
Zustand	Neuware