String Processing and Information Retrieval

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Approximation Ratios of $$\mathsf {RePair}$$ , $$\mathsf {LongestMatch}$$ and $$\mathsf {Greedy}$$ on Unary Strings
3. Altmetric Badge
   Chapter 2 Lossless Image Compression Using List Update Algorithms
4. Altmetric Badge
   Chapter 3 Rpair: Rescaling RePair with Rsync
5. Altmetric Badge
   Chapter 4 Position Bias Estimation for Unbiased Learning-to-Rank in eCommerce Search
6. Altmetric Badge
   Chapter 5 BM25 Beyond Query-Document Similarity
7. Altmetric Badge
   Chapter 6 Network-Based Pooling for Topic Modeling on Microblog Content
8. Altmetric Badge
   Chapter 7 Bounds and Estimates on the Average Edit Distance
9. Altmetric Badge
   Chapter 8 Compact Data Structures for Shortest Unique Substring Queries
10. Altmetric Badge
    Chapter 9 Fast Cartesian Tree Matching
11. Altmetric Badge
    Chapter 10 Inducing the Lyndon Array
12. Altmetric Badge
    Chapter 11 Minimal Absent Words in Rooted and Unrooted Trees
13. Altmetric Badge
    Chapter 12 On Longest Common Property Preserved Substring Queries
14. Altmetric Badge
    Chapter 13 Online Algorithms on Antipowers and Antiperiods
15. Altmetric Badge
    Chapter 14 Polynomial-Delay Enumeration of Maximal Common Subsequences
16. Altmetric Badge
    Chapter 15 Searching Runs in Streams
17. Altmetric Badge
    Chapter 16 Weighted Shortest Common Supersequence Problem Revisited
18. Altmetric Badge
    Chapter 17 Fast Identification of Heavy Hitters by Cached and Packed Group Testing
19. Altmetric Badge
    Chapter 18 Range Shortest Unique Substring Queries
20. Altmetric Badge
    Chapter 19 An Optimal Algorithm to Find Champions of Tournament Graphs
21. Altmetric Badge
    Chapter 20 A New Linear-Time Algorithm for Centroid Decomposition
22. Altmetric Badge
    Chapter 21 COBS: A Compact Bit-Sliced Signature Index
23. Altmetric Badge
    Chapter 22 An Index for Sequencing Reads Based on the Colored de Bruijn Graph
24. Altmetric Badge
    Chapter 23 Linear Time Maximum Segmentation Problems in Column Stream Model
25. Altmetric Badge
    Chapter 24 Space-Efficient Merging of Succinct de Bruijn Graphs
26. Altmetric Badge
    Chapter 25 Run-Length Encoding in a Finite Universe
27. Altmetric Badge
    Chapter 26 On the Computation of Longest Previous Non-overlapping Factors
28. Altmetric Badge
    Chapter 27 Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets
29. Altmetric Badge
    Chapter 28 Parallel External Memory Wavelet Tree and Wavelet Matrix Construction
30. Altmetric Badge
    Chapter 29 SACABench: Benchmarking Suffix Array Construction
31. Altmetric Badge
    Chapter 30 Faster Dynamic Compressed d -ary Relations
32. Altmetric Badge
    Chapter 31 Faster Repetition-Aware Compressed Suffix Trees Based on Block Trees
33. Altmetric Badge
    Chapter 32 A Practical Alphabet-Partitioning Rank/Select Data Structure
34. Altmetric Badge
    Chapter 33 Adaptive Succinctness
35. Altmetric Badge
    Chapter 34 Fast, Small, and Simple Document Listing on Repetitive Text Collections
36. Altmetric Badge
    Chapter 35 Implementing the Topological Model Succinctly
37. Altmetric Badge
    Chapter 36 Space- and Time-Efficient Storage of LiDAR Point Clouds