String Processing and Information Retrieval, Kartoniert / Broschiert
String Processing and Information Retrieval
- 32nd International Symposium, SPIRE 2025, London, UK, September 8-11, 2025, Proceedings
(soweit verfügbar beim Lieferanten)
- Herausgeber:
- Golnaz Badkobeh, Jakub Radoszewski, Nicola Tonellotto, Ricardo Baeza-Yates
- Verlag:
- Springer, 09/2025
- Einband:
- Kartoniert / Broschiert
- Sprache:
- Englisch
- ISBN-13:
- 9783032052278
- Artikelnummer:
- 12396353
- Umfang:
- 328 Seiten
- Gewicht:
- 499 g
- Maße:
- 235 x 155 mm
- Stärke:
- 18 mm
- Erscheinungstermin:
- 22.9.2025
- Hinweis
-
Achtung: Artikel ist nicht in deutscher Sprache!
Klappentext
.- 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.
