Main » SPIRE » 2022 »

String Processing and Information Retrieval - 29th International Symposium, SPIRE 2022, Concepción, Chile, November 8-10, 2022, Proceedings

Diego Arroyuelo, Barbara Poblete (Editors)


Anthology ID:
2022.spire_conference-2022
Year:
2022
Venue:
spire_conference
Publisher:
Springer
URL:
https://doi.org/10.1007/978-3-031-20643-6
DOI:
10.1007/978-3-031-20643-6
DBLP:
conf/spire/2022
BibTeX:
Download

doi dblp
String Processing and Information Retrieval - 29th International Symposium, SPIRE 2022, Concepción, Chile, November 8-10, 2022, Proceedings

doi dblp
Subsequence Covers of Words
Panagiotis Charalampopoulos | Solon P. Pissis | Jakub Radoszewski | Wojciech Rytter | Tomasz Walen | Wiktor Zuba

doi dblp
Maximal Closed Substrings
Golnaz Badkobeh | Alessandro De Luca | Gabriele Fici | Simon J. Puglisi

doi dblp
Online Algorithms for Finding Distinct Substrings with Length and Multiple Prefix and Suffix Conditions
Laurentius Leonard | Shunsuke Inenaga | Hideo Bannai | Takuya Mieno

doi dblp
The Complexity of the Co-occurrence Problem
Philip Bille | Inge Li Gørtz | Tord Stordalen

doi dblp
Reconstructing Parameterized Strings from Parameterized Suffix and LCP Arrays
Amihood Amir | Concettina Guerra | Eitan Kondratovsky | Gad M. Landau | Shoshana Marcus | Dina Sokol

doi dblp
Computing the Parameterized Burrows-Wheeler Transform Online
Daiki Hashimoto | Diptarama Hendrian | Dominik Köppl | Ryo Yoshinaka | Ayumi Shinohara

doi dblp
Accessing the Suffix Array via φ ^-Forest
Christina Boucher | Dominik Köppl | Herman Perera | Massimiliano Rossi

doi dblp
On the Optimisation of the GSACA Suffix Array Construction Algorithm
Jannik Olbrich | Enno Ohlebusch | Thomas Büchler

doi dblp
Balancing Run-Length Straight-Line Programs
Gonzalo Navarro | Francisco Olivares | Cristian Urbina

doi dblp
Substring Complexities on Run-Length Compressed Strings
Akiyoshi Kawamoto | Tomohiro I

doi dblp
How Train-Test Leakage Affects Zero-Shot Retrieval
Maik Fröbe | Christopher Akiki | Martin Potthast | Matthias Hagen

doi dblp
Genome Comparison on Succinct Colored de Bruijn Graphs
Lucas P. Ramos | Felipe A. Louza | Guilherme P. Telles

doi dblp
Sorting Genomes by Prefix Double-Cut-and-Joins
Guillaume Fertin | Géraldine Jean | Anthony Labarre

doi dblp
KATKA: A KRAKEN-Like Tool with k Given at Query Time
Travis Gagie | Sana Kashgouli | Ben Langmead

doi dblp
Computing All-vs-All MEMs in Run-Length-Encoded Collections of HiFi Reads
Diego Díaz-Domínguez | Simon J. Puglisi | Leena Salmela

doi dblp
Internal Masked Prefix Sums and Its Connection to Fully Internal Measurement Queries
Rathish Das | Meng He | Eitan Kondratovsky | J. Ian Munro | Kaiyu Wu

doi dblp
Compressed String Dictionaries via Data-Aware Subtrie Compaction
Antonio Boffa | Paolo Ferragina | Francesco Tosoni | Giorgio Vinciguerra

doi dblp
On Representing the Degree Sequences of Sublogarithmic-Degree Wheeler Graphs
Travis Gagie

doi dblp
Engineering Compact Data Structures for Rank and Select Queries on Bit Vectors
Florian Kurpicz

doi dblp
Matching Patterns with Variables Under Edit Distance
Pawel Gawrychowski | Florin Manea | Stefan Siemer

doi dblp
On the Hardness of Computing the Edit Distance of Shallow Trees
Panagiotis Charalampopoulos | Pawel Gawrychowski | Shay Mozes | Oren Weimann

doi dblp
Quantum Time Complexity and Algorithms for Pattern Matching on Labeled Graphs
Parisa Darbari | Daniel Gibney | Sharma V. Thankachan

doi dblp
Pattern Matching Under DTW Distance
Garance Gourdel | Anne Driemel | Pierre Peterlongo | Tatiana Starikovskaya