Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 2018

String Processing and Information Retrieval

25th International Symposium, SPIRE 2018, Lima, Peru, October 9-11, 2018, Proceedings

Editors:

  1. Travis Gagie

    1. Diego Portales University, Santiago, Chile

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Alistair Moffat

    1. The University of Melbourne, Melbourne, Australia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Gonzalo Navarro

    1. University of Chile, Santiago, Chile

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Ernesto Cuadros-Vargas

    1. Universidad de Ingeniería y Tecnología, Lima, Peru

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 11147)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): SPIRE: International Symposium on String Processing and Information Retrieval

Conference proceedings info: SPIRE 2018.

Sections

Buy it now

eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (28 papers)

  1. Front Matter

    Pages I-XVII
    PDF

  2. Recoloring the Colored de Bruijn Graph

    • Bahar Alipanahi, Alan Kuhnle, Christina Boucher
    Pages 1-11

  3. Efficient Computation of Sequence Mappability

    • Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski et al.
    Pages 12-26

  4. Longest Common Prefixes with k-Errors and Applications

    • Lorraine A. K. Ayad, Carl Barton, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis
    Pages 27-41

  5. Longest Property-Preserved Common Factor

    • Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis et al.
    Pages 42-49

  7. Indexed Dynamic Programming to Boost Edit Distance and LCSS Computation

    • Jérémy Barbay, Andrés Olivares
    Pages 61-73

  8. Compressed Communication Complexity of Longest Common Prefixes

    • Philip Bille, Mikko Berggreen Ettienne, Roberto Grossi, Inge Li Gørtz, Eva Rotenberg
    Pages 74-87

  9. New Structures to Solve Aggregated Queries for Trips over Public Transportation Networks

    • Nieves R. Brisaboa, Antonio Fariña, Daniil Galaktionov, Tirso V. Rodeiro, M. Andrea Rodríguez
    Pages 88-101

  10. 3DGraCT: A Grammar-Based Compressed Representation of 3D Trajectories

    • Nieves R. Brisaboa, Adrián Gómez-Brandón, Miguel A. Martínez-Prieto, José Ramón Paramá
    Pages 102-116

  11. Towards a Compact Representation of Temporal Rasters

    • Ana Cerdeira-Pena, Guillermo de Bernardo, Antonio Fariña, José Ramón Paramá, Fernando Silva-Coira
    Pages 117-130

  12. On Extended Special Factors of a Word

    • Panagiotis Charalampopoulos, Maxime Crochemore, Solon P. Pissis
    Pages 131-138

  13. Truncated DAWGs and Their Application to Minimal Absent Word Problem

    • Yuta Fujishige, Takuya Takagi, Diptarama Hendrian
    Pages 139-152

  14. The Colored Longest Common Prefix Array Computed via Sequential Scans

    • Fabio Garofalo, Giovanna Rosone, Marinella Sciortino, Davide Verzotto
    Pages 153-167

  15. Early Commenting Features for Emotional Reactions Prediction

    • Anastasia Giachanou, Paolo Rosso, Ida Mele, Fabio Crestani
    Pages 168-182

  16. Block Palindromes: A New Generalization of Palindromes

    • Keisuke Goto, I Tomohiro, Hideo Bannai, Shunsuke Inenaga
    Pages 183-190

  17. Maximal Motif Discovery in a Sliding Window

    • Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Fatima Vayani
    Pages 191-205

  18. Compressed Range Minimum Queries

    • Seungbum Jo, Shay Mozes, Oren Weimann
    Pages 206-217

  19. Fast Wavelet Tree Construction in Practice

    • Yusaku Kaneta
    Pages 218-232

  20. Faster Recovery of Approximate Periods over Edit Distance

    • Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszyński, Tomasz Waleń, Wiktor Zuba
    Pages 233-240
Back to top

Other Volumes

  1. String Processing and Information Retrieval

Back to top

About this book

This book constitutes the refereed proceedings of the 25th International Symposium on String Processing and Information Retrieval, SPIRE 2018, held in Lima, Peru, in October 2018. 
The 22 full papers and 6 short papers presented were carefully reviewed and selected from 51 submissions. They focus on fundamental studies on string processing and information retrieval, as well as on computational biology.
Back to top

Keywords

Back to top

Editors and Affiliations

  • Diego Portales University, Santiago, Chile

    Travis Gagie

  • The University of Melbourne, Melbourne, Australia

    Alistair Moffat

  • University of Chile, Santiago, Chile

    Gonzalo Navarro

  • Universidad de Ingeniería y Tecnología, Lima, Peru

    Ernesto Cuadros-Vargas

Back to top

Bibliographic Information

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Search

Navigation