<html>
<head>
<meta http-equiv="content-type" content="text/html; charset=UTF-8">
</head>
<body>
<br>
=============================<br>
SPIRE 2023 First Call for Participation<br>
30th International Symposium on String Processing and Information
Retrieval<br>
September 26-28th, Pisa, Italy<br>
followed by WCTA Workshop September 29th<br>
<font size="4"> </font><b style="font-weight:normal"
id="m_-605637827583036881docs-internal-guid-fb42722b-7fff-d8a2-dd7c-38a158346f46"><span style="font-size:14pt;font-family:Arial;color:rgb(33,33,33);background-color:rgb(255,255,255);font-weight:400;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap"><a href="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" target="_blank">http://spire2023.isti.cnr.it/</a>
</span></b>=============================<br>
<div> <br>
REGISTRATION IS NOW OPEN:<br>
<a href="http://spire2023.isti.cnr.it/registration/"
target="_blank" class="moz-txt-link-freetext">http://spire2023.isti.cnr.it/registration/</a><br>
<br>
DATES <br>
</div>
• Early Bird Registration: August 31st, 2023.<br>
• Main conference: September 26th-28th, 2023.<br>
• Workshop on Compression, Text and Algorithms (WCTA):
September 29th.<br>
<br>
VENUE<br>
Sala Gerace - Department of Computer Science<br>
Largo Pontecorvo 3, 56127 Pisa<br>
<br>
KEYNOTE SPEAKERS<br>
Sebastian Bruch, Pinecone, USA<br>
Inge Li Gortz, DTU Denmark <br>
Jakub Radoszewski, University of Warsaw, Poland<br>
<br>
FULL CONFERENCE PROGRAM<br>
<a href="http://spire2023.isti.cnr.it/program/" target="_blank"
class="moz-txt-link-freetext">http://spire2023.isti.cnr.it/program/</a><br>
<br>
PROGRAM COMMITTEE CHAIRS<br>
• Franco Maria Nardini, ISTI-CNR Pisa, Italy<br>
• Nadia Pisanti, University of Pisa, Italy<br>
• Rossano Venturini, University of Pisa, Italy<br>
<br>
ACCEPTED PAPERS<br>
<br>
Lusheng Wang and Binhai Zhu:<br>
Algorithms and Hardness for the Longest Common Subsequence of Three
Strings and Related Problems<br>
<br>
Bastien Auvray, Julien David, Richard Groult and Thierry Lecroq:<br>
Approximate Cartesian Tree Matching: an Approach Using Swaps<br>
<br>
Guillaume Blin, Alexandru Popa, Mathieu Raffinot and Raluca Uricaru:<br>
Approximation and Fixed Parameter Algorithms for the Approximate
Cover Problem<br>
<br>
Igor Zavadskyi and Maksym Kovalchuk:<br>
Binary Mixed-digit Data Compression Codes<br>
<br>
Alessio Conte, Roberto Grossi and Davide Rucci:<br>
CAGE: Cache-aware Graphlet Enumeration<br>
<br>
Nicola Rizzo, Manuel Cáceres and Veli Mäkinen:<br>
Chaining of Maximal Exact Matches in Graphs<br>
<br>
Benjamín Letelier, Nieves R. Brisaboa, Pablo Gutiérrez-Asorey, José
R. Paramá and Tirso V. Rodeiro:<br>
Compacting Massive Public Transport Data<br>
<br>
Lorenzo Carfagna and Giovanni Manzini:<br>
Compressibility Measures for Two-dimensional Data<br>
<br>
Diego Diaz and Leena Salmela:<br>
Computing All-vs-all MEMs in Grammar-compressed Text<br>
<br>
Éric Fusy and Gregory Kucherov:<br>
Count-min Sketch With Variable Number of Hash Functions: an
Experimental Study<br>
<br>
Paola Bonizzoni, Christina Boucher, Davide Cozzi, Travis Gagie,
Dominik Köppl and Massimiliano Rossi:<br>
Data Structures for SMEM-finding in the PBWT<br>
<br>
Travis Gagie, Meng He and Michael St Denis:<br>
Dynamic Compact Planar Embeddings<br>
<br>
Haruki Ideguchi, Diptarama Hendrian, Ryo Yoshinaka and Ayumi
Shinohara:<br>
Efficient Parameterized Pattern Matching in Sublinear Space<br>
<br>
Paolo Ferragina, Mariagiovanna Rotundo and Giorgio Vinciguerra:<br>
Engineering a Textbook Approach to Index Massive String Dictionaries<br>
<br>
Diego Arroyuelo, Adrián Gómez Brandón and Gonzalo Navarro:<br>
Evaluating Regular Path Queries on Compressed Adjacency Matrices<br>
<br>
Adam Cicherski and Norbert Dojer:<br>
From de Bruijn Graphs to Variation Graphs - Relationships Between
Pangenome Models<br>
<br>
Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga and
Hideo Bannai:<br>
Generalized Minimal Absent Words of Multiple Strings<br>
<br>
Kaisei Kishi, Yuto Nakashima and Shunsuke Inenaga:<br>
Largest Repetition Factorization of Fibonacci Words<br>
<br>
Jarno Alanko, Elena Biagi and Simon Puglisi:<br>
Longest Common Prefix Arrays for Succinct K-spectra<br>
<br>
Jonas Ellert, Johannes Fischer and Max Rishøj Pedersen:<br>
New Advances in Rightmost Lempel-ziv<br>
<br>
Daniel Gibney, Paul MacNichol and Sharma V. Thankachan:<br>
Non-overlapping Indexing in BWT-runs Bounded Space<br>
<br>
Amihood Amir, Eitan Kondratovsky and Avivit Levy:<br>
On Suffix Tree Detection<br>
<br>
Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Alberto
Policriti and Nicola Prezza:<br>
Optimal Wheeler Language Recognition<br>
<br>
Nicola Cotumaccio, Travis Gagie, Dominik Koeppl and Nicola Prezza:<br>
Space-time Trade-offs for the LCP Array of Wheeler DFAs<br>
<br>
Łukasz Kondraciuk:<br>
String Covers of a Tree Revisited<br>
<br>
Jonas Ellert:<br>
Sublinear Time Lempel-ziv 77 Factorization<br>
<br>
Travis Gagie, Sana Kashgouli and Gonzalo Navarro:<br>
A Simple Grammar-based Index for Finding Approximately Longest
Common Substrings (Short Paper)<br>
<br>
Zsuzsanna Liptak, Francesco Masillo, Gonzalo Navarro and Aaron
Williams:<br>
Constant Time and Space Updates for the Sigma-tau~Problem (Short
Paper)<br>
<br>
Solon Pissis, Michael Shekelyan, Chang Liu and Grigorios Loukides:<br>
Frequency-Constrained Substring Complexity (Short Paper)<br>
<br>
Pawel Gawrychowski, Maria Kosche and Florin Manea:<br>
On the Number of Factors in the LZ-end Factorization (Short Paper)<br>
<br>
Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima
and Mizuki Sue:<br>
Optimally Computing Compressed Indexing Arrays Based on the Compact
Directed Acyclic Word Graph (Short Paper)<br>
<br>
</body>
</html>