String processing and information retrieval : 20th International Symposium, SPIRE 2013, Jerusalem, Israel, October 7-9, 2013, proceedings

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