String Processing and Information Retrieval

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Range Quantile Queries: Another Virtue of Wavelet Trees
3. Altmetric Badge
   Chapter 2 Constant Factor Approximation of Edit Distance of Bounded Height Unordered Trees
4. Altmetric Badge
   Chapter 3 k 2 -Trees for Compact Web Graph Representation
5. Altmetric Badge
   Chapter 4 On-Line Construction of Parameterized Suffix Trees
6. Altmetric Badge
   Chapter 5 Succinct Text Indexing with Wildcards
7. Altmetric Badge
   Chapter 6 A Compressed Enhanced Suffix Array Supporting Fast String Matching
8. Altmetric Badge
   Chapter 7 Compressed Suffix Arrays for Massive Data
9. Altmetric Badge
   Chapter 8 On Entropy-Compressed Text Indexing in External Memory
10. Altmetric Badge
    Chapter 9 A Linear-Time Burrows-Wheeler Transform Using Induced Sorting
11. Altmetric Badge
    Chapter 10 Novel and Generalized Sort-Based Transform for Lossless Data Compression
12. Altmetric Badge
    Chapter 11 A Two-Level Structure for Compressing Aligned Bitexts
13. Altmetric Badge
    Chapter 12 Directly Addressable Variable-Length Codes
14. Altmetric Badge
    Chapter 13 Identifying the Intent of a User Query Using Support Vector Machines
15. Altmetric Badge
    Chapter 14 Syntactic Query Models for Restatement Retrieval
16. Altmetric Badge
    Chapter 15 Use of Co-occurrences for Temporal Expressions Annotation
17. Altmetric Badge
    Chapter 16 On-Demand Associative Cross-Language Information Retrieval
18. Altmetric Badge
    Chapter 17 A Comparison of Data-Driven Automatic Syllabification Methods
19. Altmetric Badge
    Chapter 18 Efficient Index for Retrieving Top- k Most Frequent Documents
20. Altmetric Badge
    Chapter 19 Fast Single-Pass Construction of a Half-Inverted Index
21. Altmetric Badge
    Chapter 20 Two-Dimensional Distributed Inverted Files
22. Altmetric Badge
    Chapter 21 Indexing Variable Length Substrings for Exact and Approximate Matching
23. Altmetric Badge
    Chapter 22 Expectation of Strings with Mismatches under Markov Chain Distribution
24. Altmetric Badge
    Chapter 23 Consensus Optimizing Both Distance Sum and Radius
25. Altmetric Badge
    Chapter 24 Faster Algorithms for Sampling and Counting Biological Sequences
26. Altmetric Badge
    Chapter 25 Towards a Theory of Patches
27. Altmetric Badge
    Chapter 26 The Frequent Items Problem, under Polynomial Decay, in the Streaming Model
28. Altmetric Badge
    Chapter 27 Improved Approximation Results on the Shortest Common Supersequence Problem
29. Altmetric Badge
    Chapter 28 Set Intersection and Sequence Matching
30. Altmetric Badge
    Chapter 29 Generalised Matching
31. Altmetric Badge
    Chapter 30 Practical Algorithms for the Longest Common Extension Problem
32. Altmetric Badge
    Chapter 31 A Last-Resort Semantic Cache for Web Queries
33. Altmetric Badge
    Chapter 32 A Task-Based Evaluation of an Aggregated Search Interface
34. Altmetric Badge
    Chapter 33 Efficient Language-Independent Retrieval of Printed Documents without OCR
35. Altmetric Badge
    Chapter 34 Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems