String Processing and Information Retrieval, Kartoniert / Broschiert

Blurb

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