Skip to main content
Springer Nature Link
Log in

String Processing and Information Retrieval

31st International Symposium, SPIRE 2024, Puerto Vallarta, Mexico, September 23–25, 2024, Proceedings

  • Conference proceedings
  • © 2025

Overview

Editors:
  1. Zsuzsanna Lipták

    1. University of Verona, Verona, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Edleno Moura

    1. Federal University of Amazonas, Manaus, Brazil

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Karina Figueroa

    1. Michoacan University of Saint Nicholas of Hidalgo, Morelia, Mexico

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Ricardo Baeza-Yates

    1. Northeastern University, Boston, USA

    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 14899)

Included in the following conference series:

Conference proceedings info: SPIRE 2024.

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

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

This book constitutes the refereed proceedings of the 31st International Symposium on String Processing and Information Retrieval, SPIRE 2024, held in Puerto Vallarta, Mexico, during September 23–25, 2024.

The 22 full papers and 4 short papers presented in this volume were carefully reviewed and selected from 41 submissions. The papers reflect the continuation of the long and well-established tradition of encouraging high-quality research at the broad nexus of string processing, information retrieval, and computational biology.

Keywords

Table of contents (26 papers)

  1. Front Matter

    Pages i-xx
    Download chapter PDF

  2. Linear Time Reconstruction of Parameterized Strings from Parameterized Suffix and LCP Arrays for Constant-Sized Alphabets

    • Amihood Amir, Eitan Kondratovsky, Shoshana Marcus, Dina Sokol
    Pages 1-15

  3. Bijective BWT Based Compression Schemes

    • Golnaz Badkobeh, Hideo Bannai, Dominik Köppl
    Pages 16-25

  4. Indexing Finite-State Automata Using Forward-Stable Partitions

    • Ruben Becker, Sung-Hwan Kim, Nicola Prezza, Carlo Tosoni
    Pages 26-40

  5. Burst Edit Distance

    • Itai Boneh, Shay Golan, Avivit Levy, Ely Porat, B. Riva Shalom
    Pages 41-56

  6. Generalization of Repetitiveness Measures for Two-Dimensional Strings

    • Lorenzo Carfagna, Giovanni Manzini, Giuseppe Romana, Marinella Sciortino, Cristian Urbina
    Pages 57-72

  7. On Computing the Smallest Suffixient Set

    • Davide Cenzato, Francisco Olivares, Nicola Prezza
    Pages 73-87

  8. Revisiting the Folklore Algorithm for Random Access to Grammar-Compressed Strings

    • Alan M. Cleary, Joseph Winjum, Jordan Dood, Shunsuke Inenaga
    Pages 88-101

  9. Logarithmic-Time Internal Pattern Matching Queries in Compressed and Dynamic Texts

    • Anouk Duyster, Tomasz Kociumaka
    Pages 102-117

  10. Bounded-Ratio Gapped String Indexing

    • Arnab Ganguly, Daniel Gibney, Paul MacNichol, Sharma V. Thankachan
    Pages 118-126

  11. Simultaneously Building and Reconciling a Synteny Tree

    • Mathieu Gascon, Mattéo Delabre, Nadia El-Mabrouk
    Pages 127-142Open Access

  12. Quantum Algorithms for Longest Common Substring with a Gap

    • Daniel Gibney, Md Helal Hossen
    Pages 143-158

  13. Online Computation of String Net Frequency

    • Peaker Guo, Seeun William Umboh, Anthony Wirth, Justin Zobel
    Pages 159-173

  14. On the Number of Non-equivalent Parameterized Squares in a String

    • Rikuya Hamai, Kazushi Taketsugu, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
    Pages 174-183

  15. Another Virtue of Wavelet Forests

    • Aaron Hong, Christina Boucher, Travis Gagie, Yansong Li, Norbert Zeh
    Pages 184-191

  16. All-Pairs Suffix-Prefix on Dynamic Set of Strings

    • Masaru Kikuchi, Shunsuke Inenaga
    Pages 192-203

  17. Adaptive Dynamic Bitvectors

    • Gonzalo Navarro
    Pages 204-217

  18. Compressed Graph Representations for Evaluating Regular Path Queries

    • Gonzalo Navarro, Josefa Robert
    Pages 218-232

  19. Greedy Conjecture for the Shortest Common Superstring Problem and Its Strengthenings

    • Maksim S. Nikolaev
    Pages 233-248

  20. Faster Computation of Chinese Frequent Strings and Their Net Frequencies

    • Enno Ohlebusch, Thomas Büchler, Jannik Olbrich
    Pages 249-256
Back to top

Other volumes

  1. String Processing and Information Retrieval

Editors and Affiliations

  • University of Verona, Verona, Italy

    Zsuzsanna Lipták

  • Federal University of Amazonas, Manaus, Brazil

    Edleno Moura

  • Michoacan University of Saint Nicholas of Hidalgo, Morelia, Mexico

    Karina Figueroa

  • Northeastern University, Boston, USA

    Ricardo Baeza-Yates

Bibliographic Information

Publish with us

Policies and ethics

Back to top