String Processing and Information Retrieval

1. Front Matter

   PDF

2. Consolidating and Exploring Information via Textual Inference

   • Ido Dagan

   Pages 1-1

3. Pattern Discovery and Listing in Graphs

   • Roberto Grossi

   Pages 2-2

4. Efficient Approximation of Edit Distance

   • Robert Krauthgamer

   Pages 3-3

5. Nowcasting with Google Trends

   • Yossi Matias

   Pages 4-4

6. Space-Efficient Construction of the Burrows-Wheeler Transform

   • Timo Beller, Maike Zwerger, Simon Gog, Enno Ohlebusch

   Pages 5-16

7. Using Mutual Influence to Improve Recommendations

   • Aline Bessa, Adriano Veloso, Nivio Ziviani

   Pages 17-28

8. Position-Restricted Substring Searching over Small Alphabets

   • Sudip Biswas, Tsung-Han Ku, Rahul Shah, Sharma V. Thankachan

   Pages 29-36

9. Simulation Study of Multi-threading in Web Search Engine Processors

   • Carolina Bonacic, Mauricio Marin

   Pages 37-48

10. Query Processing in Highly-Loaded Search Engines

    • Daniele Broccolo, Craig Macdonald, Salvatore Orlando, Iadh Ounis, Raffaele Perego, Fabrizio Silvestri et al.

    Pages 49-55

11. Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs

    • Ferdinando Cicalese, Travis Gagie, Emanuele Giaquinta, Eduardo Sany Laber, Zsuzsanna Lipták, Romeo Rizzi et al.

    Pages 56-63

12. Adaptive Data Structures for Permutations and Binary Relations

    • Francisco Claude, J. Ian Munro

    Pages 64-71

13. Document Listing on Versioned Documents

    • Francisco Claude, J. Ian Munro

    Pages 72-83

14. Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes

    • Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis et al.

    Pages 84-95

15. Compact Querieable Representations of Raster Data

    • Guillermo de Bernardo, Sandra Álvarez-García, Nieves R. Brisaboa, Gonzalo Navarro, Oscar Pedreira

    Pages 96-108

16. Top-k Color Queries on Tree Paths

    • Stephane Durocher, Rahul Shah, Matthew Skala, Sharma V. Thankachan

    Pages 109-115

17. A Lempel-Ziv Compressed Structure for Document Listing

    • Héctor Ferrada, Gonzalo Navarro

    Pages 116-128

18. Minimal Discriminating Words Problem Revisited

    • Paweł Gawrychowski, Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya

    Pages 129-140

19. Adding Compression and Blended Search to a Compact Two-Level Suffix Array

    • Simon Gog, Alistair Moffat

    Pages 141-152

20. You Are What You Eat: Learning User Tastes for Rating Prediction

    • Morgan Harvey, Bernd Ludwig, David Elsweiler

    Pages 153-164

This book constitutes the refereed proceedings of the 20th International Symposium on String Processing and Information Retrieval, SPIRE 2013, held in Jerusalem, Israel, in October 2013. The 18 full papers, 10 short papers were carefully reviewed and selected from 60 submissions. The program also featured 4 keynote speeches. The following topics are covered: fundamentals algorithms in string processing and information retrieval; SP and IR techniques as applied to areas such as computational biology, DNA sequencing, and Web mining.

• combinatorial algorithms
• graphs
• information retrieval
• query processing
• search engines
• algorithm analysis and problem complexity

• Faculty of Industrial Engineering and Management Technion, Technion Institute of Technology, Haifa, Israel

  Oren Kurland

• Bar-Ilan University, Israel

  Moshe Lewenstein

• Department of Computer Science, Bar-Ilan University, Ramat-Gan, Israel

  Ely Porat

Policies and ethics