String Processing and Information Retrieval

Nyhet

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

Häftad, Engelska, 2025

Av Golnaz Badkobeh, Jakub Radoszewski, Nicola Tonellotto, Ricardo Baeza-Yates

1 129 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum2025-09-22
Mått155 x 235 x 18 mm
Vikt499 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor306
FörlagSpringer Nature Switzerland AG
ISBN9783032052278

Tillhör följande kategorier

Referensverk och tvärvetenskap inom Samhalle och politik
Beräkning och matematisk analys inom Naturvetenskap och teknik
Hårdvara inom Data och it
Programmeringsböcker inom Data och it
Systemvetenskap och AI inom Data och it
Artificiell intelligens inom Data och it

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