String Processing and Information Retrieval

1. Front Matter

   Pages I-XVII

   PDF

2. Faster Exact Search Using Document Clustering

   • Jonathan Dimond, Peter Sanders

   Pages 1-12

3. Fast Online Lempel-Ziv Factorization in Compressed Space

   • Alberto Policriti, Nicola Prezza

   Pages 13-20

4. Adaptive Computation of the Swap-Insert Correction Distance

   • Jérémy Barbay, Pablo Pérez-Lantero

   Pages 21-32

5. Transforming XML Streams with References

   • Sebastian Maneth, Alberto Ordóñez, Helmut Seidl

   Pages 33-45

6. Efficient Term Set Prediction Using the Bell-Wigner Inequality

   • Massimo Melucci

   Pages 46-53

7. On Prefix/Suffix-Square Free Words

   • Marius Dumitran, Florin Manea, Dirk Nowotka

   Pages 54-66

8. Temporal Analysis of CHAVE Collection

   • Olga Craveiro, Joaquim Macedo, Henrique Madeira

   Pages 67-74

9. DeShaTo: Describing the Shape of Cumulative Topic Distributions to Rank Retrieval Systems Without Relevance Judgments

   • Radu Tudor Ionescu, Adrian-Gabriel Chifu, Josiane Mothe

   Pages 75-82

10. Induced Sorting Suffixes in External Memory with Better Design and Less Space

    • Wei Jun Liu, Ge Nong, Wai Hong Chan, Yi Wu

    Pages 83-94

11. Efficient Algorithms for Longest Closed Factor Array

    • Hideo Bannai, Shunsuke Inenaga, Tomasz Kociumaka, Arnaud Lefebvre, Jakub Radoszewski, Wojciech Rytter et al.

    Pages 95-102

12. A Compact RDF Store Using Suffix Arrays

    • Nieves R. Brisaboa, Ana Cerdeira-Pena, Antonio Fariña, Gonzalo Navarro

    Pages 103-115

13. Chaining Fragments in Sequences: to Sweep or Not (Extended Abstract)

    • Julien Allali, Cedric Chauve, Laetitia Bourgeade

    Pages 116-123

14. A Faster Algorithm for Computing Maximal \(\alpha \)-gapped Repeats in a String

    • Yuka Tanimura, Yuta Fujishige, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

    Pages 124-136

15. Selective Labeling and Incomplete Label Mitigation for Low-Cost Evaluation

    • Kai Hui, Klaus Berberich

    Pages 137-148

16. Relative Select

    • Christina Boucher, Alexander Bowe, Travis Gagie, Giovanni Manzini, Jouni Sirén

    Pages 149-155

17. Temporal Query Classification at Different Granularities

    • Dhruv Gupta, Klaus Berberich

    Pages 156-164

18. Prefix and Suffix Reversals on Strings

    • Guillaume Fertin, Loïc Jankowiak, Géraldine Jean

    Pages 165-176

19. Filtration Algorithms for Approximate Order-Preserving Matching

    • Tamanna Chhabra, Emanuele Giaquinta, Jorma Tarhio

    Pages 177-187

20. Fishing in Read Collections: Memory Efficient Indexing for Sequence Assembly

    • Vladimír Boža, Jakub Jursa, Broňa Brejová, Tomáš Vinař

    Pages 188-198

This book constitutes the refereed proceedings of the 22nd International Symposium on String Processing and Information Retrieval, SPIRE 2015, held in London, UK, in September 2015. The 28 full and 6 short papers included in this volume were carefully reviewed and selected from 90 submissions. The papers cover research in all aspects of string processing, information retrieval, computational biology, pattern matching, semi-structured data, and related applications.

• algorithms
• approximation algorithm
• bioinformatics
• data compression
• databases
• experimental evaluation
• graphs
• information retrieval
• lempel-ziv
• natural language processing
• pattern matching
• search
• search engines
• sequences and graphs
• string processing
• data mining
• data structures
• dynamic programming
• query processing
• string search

• King's College London, London, United Kingdom

  Costas Iliopoulos

• University of Helsinki, Helsinki, Finland

  Simon Puglisi

• University College London, London, United Kingdom

  Emine Yilmaz

Policies and ethics