String Processing and Information Retrieval: 32nd International Symposium, SPIRE 2025, London, UK, September...

— —

Golnaz Badkobeh Jakub Radoszewski

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

$162.95 $130.01

Paperback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

Springer Nature Switzerland AG
22 September 2025

Information theory; Numerical analysis; Computer hardware; Algorithms & data structures; Mathematical theory of computation

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

Edited by: Golnaz Badkobeh, Jakub Radoszewski, Nicola Tonellotto, Ricardo Baeza-Yates
Imprint: Springer Nature Switzerland AG
Country of Publication: Switzerland
Dimensions: Height: 235mm, Width: 155mm,
ISBN: 9783032052278
ISBN 10: 3032052270
Series: Lecture Notes in Computer Science
Pages: 306
Publication Date: 22 September 2025
Audience: College/higher education , Professional and scholarly , Further / Higher Education , Undergraduate
Format: Paperback
Publisher's Status: Active

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