String Processing and Information Retrieval

Consolidating and Exploring information via Textual Inference.- Pattern Discovery and Listing in Graphs.- Efficient Approximation of Edit Distance.- Nowcasting with Google Trends.- Space-efficient Construction of the Burrows-Wheeler Transform.- Using Mutual Inuence to Improve Recommendations.- Position-Restricted Substring Searching Over Small Alphabets.- Simulation Study of Multi-threading in Web Search Engine Processors.- Query Processing in Highly-Loaded Search Engines.- Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs.- Adaptive Data Structures for Permutations and Binary Relations.- Document Listing on Versioned Documents.- Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes.- Compact Querieable Representations of Raster Data.- Top-k Color Queries On Tree Paths.- A Lempel-Ziv Compressed Structure for Document Listing.- Minimal Discriminating Words Problem Revisited.- Adding Compression and Blended Search to a Compact Two-Level Suffix Array.- You are what you eat: learning user tastes for rating prediction.- Discovering dense subgraphs in parallel for compressing Web and Social networks.- Faster Lyndon factorization algorithms for SLP and LZ78 compressed text.- Lossless compression of rotated maskless lithography images.- Learning URL Normalization Rules using Multiple Alignment of Sequences.- On Two-Dimensional Lyndon Words.- Fully-Online Grammar Compression.- Solving Graph Isomorphism using Parameterized Matching.- Suffix Array of Alignment: A Practical Index for Similar Data.- Faster Top-k Document Retrieval in Optimal Space.- Faster Range LCP Queries.- Learning to Schedule Webpage Updates Using Genetic Programming.- Accurate Profiling of Microbial Communities from Massively Parallel Sequencing using Convex Optimization.- Distributed Query Processing on Compressed Graphs using K2-Trees.