[CPM-SPIRE-L] SPIRE 2024 in Puerto Vallarta, Mexico: Call for Participation (early registration until Aug. 2)

[Zsuzsanna Liptak]

(Apologies for multiple copies.)

========================================================
SPIRE 2024 - Call for Participation
========================================================

The 31st International Symposium on String Processing and Information Retrieval (SPIRE 2024) will be held in Puerto Vallarta, Jalisco, Mexico, on Sept 23-25, 2024. SPIRE 2024 covers research in all aspects of string processing, information retrieval, computational biology, and related applications.

* Conference website: http://computo.fismat.umich.mx/spire2024/

* Conference dates: Sept. 23-25, 2024 (Mo-Wed)

* Workshop on Compression, Text, and Algorithms (WCTA): September 26, 2024 (Thu)

* Early registration until: Aug. 2, 2024 (AoE)


--------------------------------------------------------
Keynote Speakers
--------------------------------------------------------

Juliana Freire (New York University, US): "Dataset Search for Data Discovery,
Augmentation, and Explanation"

Marinella Sciortino (University of Palermo, Italy): "Exploring Repetitiveness in Texts: from BWT to Morphisms"

Gerardo Sierra (National Autonomous University of Mexico, Mexico): "Preservation and Accessibility of Documentary Heritage"


--------------------------------------------------------
Venue
--------------------------------------------------------

The 31st International Symposium on String Processing and Information Retrieval (SPIRE 2024) will be held on the Pacific Ocean beach in Puerto Vallarta, Jalisco. Puerto Vallarta is a world-class tourist destination, with warm, sunny weather year-round, and a strategic location for all SPIRE attendees. Puerto Vallarta’s International Airport provides easy access worldwide (more than 200 weekly direct flights from 85 destinations).

The conference will be held at the Fiesta Inn Hotel. Special rates for SPIRE attendees have been negotiated.

For more, see:
http://computo.fismat.umich.mx/spire2024/venue.html
http://computo.fismat.umich.mx/spire2024/registration.html


--------------------------------------------------------
Workshop on Compression, Text, and Algorithms (WCTA 2024)
--------------------------------------------------------

SPIRE 2024 will be accompanied by the one-day workshop WCTA 2024 ("19th Workshop on Compression, Text, and Algorithms"), which will feature an invited talk and contributed talks on topics related to text compression and algorithms. WCTA is a forum primarily intended for early-stage researchers to present their work. There are no published proceedings, so the results presented can also be submitted to most other workshops and conferences. A separate call for papers for WCTA 2024 will follow soon.


--------------------------------------------------------
List of Accepted Papers
--------------------------------------------------------

* Alan Cleary, Joseph Winjum, Jordan Dood and Shunsuke Inenaga. Revisiting the Folklore Algorithm for Random Access to Grammar-Compressed Strings
* 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
* Hiroki Shibata and Dominik Köppl. LZ78 Substring Compression with CDAWGs
* Enno Ohlebusch, Thomas Büchler and Jannik Olbrich. Faster computation of Chinese frequent strings and their net frequencies
* Wataru Sumiyoshi, Takuya Mieno and Shunsuke Inenaga. Faster and simpler online/sliding rightmost Lempel-Ziv factorizations
* Gonzalo Navarro. Adaptive Dynamic Bitvectors
* Davide Cenzato, Francisco Olivares and Nicola Prezza. On Computing the Smallest Suffixient Set
* Ruben Becker, Sung-Hwan Kim, Nicola Prezza and Carlo Tosoni. Indexing Finite-State Automata Using Forward-Stable Partitions
* Lorenzo Carfagna, Giovanni Manzini, Giuseppe Romana, Marinella Sciortino and Cristian Urbina. Generalization of Repetitiveness Measures for Two-Dimensional Strings
* Jakub Radoszewski and Wiktor Zuba. Computing String Covers in Sublinear Time
* Mathieu Gascon, Mattéo Delabre and Nadia El-Mabrouk. Simultaneously Building and Reconciling a Synteny Tree
* Aaron Hong, Christina Boucher, Travis Gagie, Yansong Li and Norbert Zeh. Another virtue of wavelet forests
* Daniel Gibney and Md Helal Hossen. Quantum Algorithms for Longest Common Substring with a Gap
* Anouk Duyster and Tomasz Kociumaka. Logarithmic-Time Internal Pattern Matching Queries in Compressed and Dynamic Texts
* Masaru Kikuchi and Shunsuke Inenaga. All-Pairs Suffix-Prefix on Dynamic Set of Strings
* Akito Takasaka and Tomohiro I. Space-efficient SLP Encoding for $O(\log N)$-time Random Access
* Arnab Ganguly, Daniel Gibney, Paul MacNichol and Sharma V. Thankachan. Bounded-Ratio Gapped String Indexing
* Maksim Nikolaev. Greedy Conjecture for the Shortest Common Superstring Problem and its Strengthenings
* Golnaz Badkobeh, Hideo Bannai and Dominik Köppl. Bijective BWT based Compression Schemes
* Rikuya Hamai, Kazushi Taketsugu, Yuto Nakashima, Shunsuke Inenaga and Hideo Bannai. On the Number of Non-equivalent Parameterized Squares in a String
* Peaker Guo, Seeun William Umboh, Anthony Wirth and Justin Zobel. Online Computation of String Net Frequency
* Itai Boneh, Shay Golan, Avivit Levy, Ely Porat and B. Riva Shalom. Burst Edit Distance
* Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń. Faster Algorithms for Ranking/Unranking Bordered and Unbordered Words
* Yuki Yonemoto and Shunsuke Inenaga. Simple linear-time repetition factorization
* Dina Sokol, Shoshana Marcus and Sarah Zelikovitz. 2d Side-Sharing Tandems with Mismatches
* Gonzalo Navarro and Josefa Robert. Compressed Graph Representations for Evaluating Regular Path Queries


--------------------------------------------------------
Contacts
--------------------------------------------------------

Organizing Committee Chair:
Karina Mariela Figueroa Mora, karina.figueroa[at]umich.mx

Program Committee Chairs:
Zsuzsanna Lipták, zsuzsanna.liptak[at]univr.it
Edleno Silva De Moura, edleno[at]icomp.ufam.edu.br

==========================================================


-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://fenris.cs.ucr.edu/pipermail/cpm-spire-l/attachments/20240801/8462cf49/attachment-0001.html>