{"product_id":"string-processing-and-information-retrieval-9783032052278","title":"String Processing and Information Retrieval","description":"\u003cb\u003eBook Synopsis\u003c\/b\u003e\u003cbr\u003e\u003cp\u003e.- New perspectives on the Burrows–Wheeler Transform (Keynote).\u003c\/p\u003e\u003cp\u003e.- Scaling genomic reuse: hypothesis and algorithms for k-mer collections (Keynote).\u003c\/p\u003e\u003cp\u003e.- Succinct Dynamic Data Structures (25 years on) (Keynote).\u003c\/p\u003e\u003cp\u003e.- Testing Quasiperiodicity.\u003c\/p\u003e\u003cp\u003e.- KeBaB: k-mer based breaking for finding long MEMs.\u003c\/p\u003e\u003cp\u003e.- Analysing New Entropy Measures for Tries.\u003c\/p\u003e\u003cp\u003e.- Depth first representations of kˆ2-trees.\u003c\/p\u003e\u003cp\u003e.- Dorst–Smeulders Coding for Arbitrary Binary Words.\u003c\/p\u003e\u003cp\u003e.- Prefix-free parsing for merging big BWTs.\u003c\/p\u003e\u003cp\u003e.- RLZ-r and LZ-End-r: Enhancing Move-r.\u003c\/p\u003e\u003cp\u003e.- Massively Parallel Computation of Matching Statistics.\u003c\/p\u003e\u003cp\u003e.- Cache-Friendly Compressed Boolean Matrices.\u003c\/p\u003e\u003cp\u003e.- Tight Additive Sensitivity on LZ-style Compressors and String Attractors.\u003c\/p\u003e\u003cp\u003e.- On the number of MUSs crossing a position.\u003c\/p\u003e\u003cp\u003e.- String Consensus Problems with Swaps and Substitutions.\u003c\/p\u003e\u003cp\u003e.- Two-Player Communication Complexity of Pattern Matching.\u003c\/p\u003e\u003cp\u003e.- REINDEER2: practical abundance index at scale.\u003c\/p\u003e\u003cp\u003e.- Efficient Computation of Closed Substrings.\u003c\/p\u003e\u003cp\u003e.- Nyldon Factorization of Thue-Morse Words and Fibonacci Words.\u003c\/p\u003e\u003cp\u003e.- String Matching with a Dynamic Pattern.\u003c\/p\u003e\u003cp\u003e.- Smallest Suffixient Sets as a Repetitiveness Measure.\u003c\/p\u003e\u003cp\u003e.- Longest Unbordered Factors on Run-Length Encoded Strings.\u003c\/p\u003e\u003cp\u003e.- Longest Common Subsequence in k-length substrings for Run-Length-Encoded strings.\u003c\/p\u003e\u003cp\u003e.- Practical algorithms for Hierarchical Overlap Graphs.\u003c\/p\u003e\u003cp\u003e.- Counting distinct (non-)crossing substrings.\u003c\/p\u003e\u003cp\u003e.- Faster Algorithm for Bounded Damerau–Levenshtein Distance.\u003c\/p\u003e","brand":"Springer","offers":[{"title":"Default Title","offer_id":53195524145495,"sku":"9783032052278","price":59.99,"currency_code":"GBP","in_stock":true}],"url":"https:\/\/bookcurl.com\/products\/string-processing-and-information-retrieval-9783032052278","provider":"Book Curl","version":"1.0","type":"link"}