String Processing and Information Retrieval

- Algorithms on Trees
- Range Quantile Queries: Another Virtue of Wavelet Trees
- Constant Factor Approximation of Edit Distance of Bounded Height Unordered Trees
- k2-Trees for Compact Web Graph Representation
- On-Line Construction of Parameterized Suffix Trees
- Compressed Indexes
- Succinct Text Indexing with Wildcards
- A Compressed Enhanced Suffix Array Supporting Fast String Matching
- Compressed Suffix Arrays for Massive Data
- On Entropy-Compressed Text Indexing in External Memory
- Compression
- A Linear-Time Burrows-Wheeler Transform Using Induced Sorting
- Novel and Generalized Sort-Based Transform for Lossless Data Compression
- A Two-Level Structure for Compressing Aligned Bitexts
- Directly Addressable Variable-Length Codes
- Content Analysis
- Identifying the Intent of a User Query Using Support Vector Machines
- Syntactic Query Models for Restatement Retrieval
- Use of Co-occurrences for Temporal Expressions Annotation
- On-Demand Associative Cross-Language Information Retrieval
- A Comparison of Data-Driven Automatic Syllabification Methods
- Indexing
- Efficient Index for Retrieving Top-k Most Frequent Documents
- Fast Single-Pass Construction of a Half-Inverted Index
- Two-Dimensional Distributed Inverted Files
- Indexing Variable Length Substrings for Exact and Approximate Matching
- String Algorithms and Bioinformatics
- Expectation of Strings with Mismatches under Markov Chain Distribution
- Consensus Optimizing Both Distance Sum and Radius
- Faster Algorithms for Sampling and Counting Biological Sequences
- String Algorithms and Theory I
- Towards a Theory of Patches
- The Frequent Items Problem, under Polynomial Decay, in the Streaming Model
- Improved Approximation Results on the Shortest Common Supersequence Problem
- String Algorithms and Theory II
- Set Intersection and Sequence Matching
- Generalised Matching
- Practical Algorithms for the Longest Common Extension Problem
- Using and Understanding