[CPM-SPIRE-L] SPIRE 2023 - 1st CALL FOR PARTICIPATION

[Nadia Pisanti]

=============================
SPIRE 2023 First Call for Participation
30th International Symposium on String Processing and Information Retrieval
September 26-28th, Pisa, Italy
followed by WCTA Workshop September 29th
*http://spire2023.isti.cnr.it/ 
<https://es.sonicurlprotection-fra.com/click?PV=2&MSGID=202303172307480279177&URLID=10&ESV=10.0.19.7431&IV=47D8A770227F9E3756E0D0D701EA98A6&TT=1679094469055&ESN=7OfB%2BI9HXu4Qt2hjPXdRvLD6pnY1Mz7zWn9p%2BRQ1xOQ%3D&KV=1536961729280&B64_ENCODED_URL=aHR0cDovL3NwaXJlMjAyMy5pc3RpLmNuci5pdC8&HK=F34AAE25E74593B62BBB572E31F2F839D37A2EE257884CD12EF9C1890312E520> 
*=============================

REGISTRATION IS NOW OPEN:
http://spire2023.isti.cnr.it/registration/

DATES
     •    Early Bird Registration: August 31st, 2023.
     •    Main conference: September 26th-28th, 2023.
     •    Workshop on Compression, Text and Algorithms (WCTA): September 
29th.

VENUE
Sala Gerace - Department of Computer Science
Largo Pontecorvo 3, 56127 Pisa

KEYNOTE SPEAKERS
Sebastian Bruch, Pinecone, USA
Inge Li Gortz, DTU Denmark
Jakub Radoszewski, University of Warsaw, Poland

FULL CONFERENCE PROGRAM
http://spire2023.isti.cnr.it/program/

PROGRAM COMMITTEE CHAIRS
     •    Franco Maria Nardini, ISTI-CNR Pisa, Italy
     •    Nadia Pisanti, University of Pisa, Italy
     •    Rossano Venturini, University of Pisa, Italy

ACCEPTED PAPERS

Lusheng Wang and Binhai Zhu:
Algorithms and Hardness for the Longest Common Subsequence of Three 
Strings and Related Problems

Bastien Auvray, Julien David, Richard Groult and Thierry Lecroq:
Approximate Cartesian Tree Matching: an Approach Using Swaps

Guillaume Blin, Alexandru Popa, Mathieu Raffinot and Raluca Uricaru:
Approximation and Fixed Parameter Algorithms for the Approximate Cover 
Problem

Igor Zavadskyi and Maksym Kovalchuk:
Binary Mixed-digit Data Compression Codes

Alessio Conte, Roberto Grossi and Davide Rucci:
CAGE: Cache-aware Graphlet Enumeration

Nicola Rizzo, Manuel Cáceres and Veli Mäkinen:
Chaining of Maximal Exact Matches in Graphs

Benjamín Letelier, Nieves R. Brisaboa, Pablo Gutiérrez-Asorey, José R. 
Paramá and Tirso V. Rodeiro:
Compacting Massive Public Transport Data

Lorenzo Carfagna and Giovanni Manzini:
Compressibility Measures for Two-dimensional Data

Diego Diaz and Leena Salmela:
Computing All-vs-all MEMs in Grammar-compressed Text

Éric Fusy and Gregory Kucherov:
Count-min Sketch With Variable Number of Hash Functions: an Experimental 
Study

Paola Bonizzoni, Christina Boucher, Davide Cozzi, Travis Gagie, Dominik 
Köppl and Massimiliano Rossi:
Data Structures for SMEM-finding in the PBWT

Travis Gagie, Meng He and Michael St Denis:
Dynamic Compact Planar Embeddings

Haruki Ideguchi, Diptarama Hendrian, Ryo Yoshinaka and Ayumi Shinohara:
Efficient Parameterized Pattern Matching in Sublinear Space

Paolo Ferragina, Mariagiovanna Rotundo and Giorgio Vinciguerra:
Engineering a Textbook Approach to Index Massive String Dictionaries

Diego Arroyuelo, Adrián Gómez Brandón and Gonzalo Navarro:
Evaluating Regular Path Queries on Compressed Adjacency Matrices

Adam Cicherski and Norbert Dojer:
 From de Bruijn Graphs to Variation Graphs - Relationships Between 
Pangenome Models

Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga and Hideo 
Bannai:
Generalized Minimal Absent Words of Multiple Strings

Kaisei Kishi, Yuto Nakashima and Shunsuke Inenaga:
Largest Repetition Factorization of Fibonacci Words

Jarno Alanko, Elena Biagi and Simon Puglisi:
Longest Common Prefix Arrays for Succinct K-spectra

Jonas Ellert, Johannes Fischer and Max Rishøj Pedersen:
New Advances in Rightmost Lempel-ziv

Daniel Gibney, Paul MacNichol and Sharma V. Thankachan:
Non-overlapping Indexing in BWT-runs Bounded Space

Amihood Amir, Eitan Kondratovsky and Avivit Levy:
On Suffix Tree Detection

Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Alberto 
Policriti and Nicola Prezza:
Optimal Wheeler Language Recognition

Nicola Cotumaccio, Travis Gagie, Dominik Koeppl and Nicola Prezza:
Space-time Trade-offs for the LCP Array of Wheeler DFAs

Łukasz Kondraciuk:
String Covers of a Tree Revisited

Jonas Ellert:
Sublinear Time Lempel-ziv 77 Factorization

Travis Gagie, Sana Kashgouli and Gonzalo Navarro:
A Simple Grammar-based Index for Finding Approximately Longest Common 
Substrings (Short Paper)

Zsuzsanna Liptak, Francesco Masillo, Gonzalo Navarro and Aaron Williams:
Constant Time and Space Updates for the Sigma-tau~Problem (Short Paper)

Solon Pissis, Michael Shekelyan, Chang Liu and Grigorios Loukides:
Frequency-Constrained Substring Complexity (Short Paper)

Pawel Gawrychowski, Maria Kosche and Florin Manea:
On the Number of Factors in the LZ-end Factorization (Short Paper)

Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima and 
Mizuki Sue:
Optimally Computing Compressed Indexing Arrays Based on the Compact 
Directed Acyclic Word Graph (Short Paper)
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://fenris.cs.ucr.edu/pipermail/cpm-spire-l/attachments/20230801/92a281a4/attachment.html>