31st International Symposium on String Processing and Information Retrieval

Puerto Vallarta, Jalisco, México
September 23th-25th, 2024

31st International Symposium on String Processing and Information Retrieval

SPIRE 2024 - Program

MONDAY

Session 1: Grammar- and LZ-based compression

  • Alan Cleary, Joseph Winjum, Jordan Dood and Shunsuke Inenaga.
    Revisiting the Folklore Algorithm for Random Access to Grammar-Compressed Strings
  • Akito Takasaka and Tomohiro I.
    Space-efficient SLP Encoding for O(log N)-time Random Access
  • Hiroki Shibata and Dominik Köppl.
    LZ78 Substring Compression with CDAWGs
  • Wataru Sumiyoshi, Takuya Mieno and Shunsuke Inenaga.
    Faster and simpler online/sliding rightmost Lempel-Ziv factorizations

    • Session 2: Data structures

  • Gonzalo Navarro and Josefa Robert.
    Compressed Graph Representations for Evaluating Regular Path Queries
  • Ruben Becker, Sung-Hwan Kim, Nicola Prezza and Carlo Tosoni.
    Indexing Finite-State Automata Using Forward-Stable Partitions
  • Gonzalo Navarro.
    Adaptive Dynamic Bitvectors
  • Aaron Hong, Christina Boucher, Travis Gagie, Yansong Li and Norbert Zeh.
    Another virtue of wavelet forests (short paper)

    • Session 3: String algorithms and indexing I

  • Davide Cenzato, Francisco Olivares and Nicola Prezza.
    On Computing the Smallest Suffixient Set
  • Anouk Duyster and Tomasz Kociumaka.
    Logarithmic-Time Internal Pattern Matching Queries in Compressed and Dynamic Texts
  • Dina Sokol, Shoshana Marcus and Sarah Zelikovitz.
    2d Side-Sharing Tandems with Mismatches

    • TUESDAY

    Session 4: Combinatorics on words
  • Jakub Radoszewski and Wiktor Zuba.
    Computing String Covers in Sublinear Time
  • Rikuya Hamai, Kazushi Taketsugu, Yuto Nakashima, Shunsuke Inenaga and Hideo Bannai.
    On the Number of Non-equivalent Parameterized Squares in a String
  • Yuki Yonemoto and Shunsuke Inenaga.
    Simple linear-time repetition factorization
  • Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń.
    Faster Algorithms for Ranking/Unranking Bordered and Unbordered Words

    • WEDNESDAY

    Session 5: String algorithms and indexing II
  • Peaker Guo, Seeun William Umboh, Anthony Wirth and Justin Zobel.
    Online Computation of String Net Frequency
  • Enno Ohlebusch, Thomas Büchler and Jannik Olbrich.
    Faster computation of Chinese frequent strings and their net frequencies (short paper)
  • Arnab Ganguly, Daniel Gibney, Paul MacNichol and Sharma V. Thankachan.
    Bounded-Ratio Gapped String Indexing (short paper)

    • Session 6: Repetitiveness measures and string algorithms

  • Daniel Gibney and Md Helal Hossen.
    Quantum Algorithms for Longest Common Substring with a Gap
  • Amihood Amir, Eitan Kondratovsky, Shoshana Marcus and Dina Sokol.
    Linear Time Reconstruction of Parameterized Strings from Parameterized Suffix and LCP Arrays for Constant-Sized Alphabets
  • Lorenzo Carfagna, Giovanni Manzini, Giuseppe Romana, Marinella Sciortino and Cristian Urbina.
    Generalization of Repetitiveness Measures for Two-Dimensional Strings
  • Golnaz Badkobeh, Hideo Bannai and Dominik Köppl.
    Bijective BWT based Compression Schemes (short paper)

    • Session 7: Computational biology motivated problems

  • Maksim Nikolaev.
    Greedy Conjecture for the Shortest Common Superstring Problem and its Strengthenings
  • Mathieu Gascon, Mattéo Delabre and Nadia El-Mabrouk.
    Simultaneously Building and Reconciling a Synteny Tree
  • Masaru Kikuchi and Shunsuke Inenaga.
    All-Pairs Suffix-Prefix on Dynamic Set of Strings
  • Itai Boneh, Shay Golan, Avivit Levy, Ely Porat and B. Riva Shalom.
    Burst Edit Distance

    • Contact

    For more information, please contact karina.figueroa at umich.mx