default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID29th SPIRE 2022: Concepción, Chile
- Diego Arroyuelo
, Barbara Poblete:
String Processing and Information Retrieval - 29th International Symposium, SPIRE 2022, Concepción, Chile, November 8-10, 2022, Proceedings. Lecture Notes in Computer Science 13617, Springer 2022, ISBN 978-3-031-20642-9
String Algorithms
- Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba:
Subsequence Covers of Words. 3-15 - Golnaz Badkobeh, Alessandro De Luca, Gabriele Fici, Simon J. Puglisi:
Maximal Closed Substrings. 16-23 - Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno:
Online Algorithms for Finding Distinct Substrings with Length and Multiple Prefix and Suffix Conditions. 24-37 - Philip Bille, Inge Li Gørtz, Tord Stordalen:
The Complexity of the Co-occurrence Problem. 38-52
String Data Structures
- Amihood Amir, Concettina Guerra, Eitan Kondratovsky, Gad M. Landau, Shoshana Marcus, Dina Sokol:
Reconstructing Parameterized Strings from Parameterized Suffix and LCP Arrays. 55-69 - Daiki Hashimoto, Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka, Ayumi Shinohara:
Computing the Parameterized Burrows-Wheeler Transform Online. 70-85 - Christina Boucher, Dominik Köppl, Herman Perera, Massimiliano Rossi:
Accessing the Suffix Array via φ -1-Forest. 86-98 - Jannik Olbrich, Enno Ohlebusch, Thomas Büchler:
On the Optimisation of the GSACA Suffix Array Construction Algorithm. 99-113
String Compression
- Gonzalo Navarro, Francisco Olivares, Cristian Urbina:
Balancing Run-Length Straight-Line Programs. 117-131 - Akiyoshi Kawamoto, Tomohiro I:
Substring Complexities on Run-Length Compressed Strings. 132-143
Information Retrieval
- Maik Fröbe, Christopher Akiki, Martin Potthast, Matthias Hagen:
How Train-Test Leakage Affects Zero-Shot Retrieval. 147-161
Computational Biology
- Lucas P. Ramos, Felipe A. Louza, Guilherme P. Telles:
Genome Comparison on Succinct Colored de Bruijn Graphs. 165-177 - Guillaume Fertin, Géraldine Jean, Anthony Labarre:
Sorting Genomes by Prefix Double-Cut-and-Joins. 178-190 - Travis Gagie, Sana Kashgouli, Ben Langmead:
KATKA: A KRAKEN-Like Tool with k Given at Query Time. 191-197 - Diego Díaz-Domínguez, Simon J. Puglisi, Leena Salmela:
Computing All-vs-All MEMs in Run-Length-Encoded Collections of HiFi Reads. 198-213
Space-Efficient Data Structures
- Rathish Das, Meng He, Eitan Kondratovsky, J. Ian Munro, Kaiyu Wu:
Internal Masked Prefix Sums and Its Connection to Fully Internal Measurement Queries. 217-232 - Antonio Boffa, Paolo Ferragina, Francesco Tosoni, Giorgio Vinciguerra:
Compressed String Dictionaries via Data-Aware Subtrie Compaction. 233-249 - Travis Gagie:
On Representing the Degree Sequences of Sublogarithmic-Degree Wheeler Graphs. 250-256 - Florian Kurpicz:
Engineering Compact Data Structures for Rank and Select Queries on Bit Vectors. 257-272
Pattern Matching on Strings, Graphs, and Trees
- Pawel Gawrychowski, Florin Manea, Stefan Siemer:
Matching Patterns with Variables Under Edit Distance. 275-289 - Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
On the Hardness of Computing the Edit Distance of Shallow Trees. 290-302 - Parisa Darbari, Daniel Gibney, Sharma V. Thankachan:
Quantum Time Complexity and Algorithms for Pattern Matching on Labeled Graphs. 303-314 - Garance Gourdel, Anne Driemel, Pierre Peterlongo, Tatiana Starikovskaya:
Pattern Matching Under DTW Distance. 315-330
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-05-23 00:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
