default search action
30th SPIRE 2023: Pisa, Italy
- Franco Maria Nardini
, Nadia Pisanti
String Processing and Information Retrieval - 30th International Symposium, SPIRE 2023, Pisa, Italy, September 26-28, 2023, Proceedings. Lecture Notes in Computer Science 14240, Springer 2023, ISBN 978-3-031-43979-7 - Jarno N. Alanko
Longest Common Prefix Arrays for Succinct k-Spectra. 1-13 - Amihood Amir
On Suffix Tree Detection. 14-27 - Hiroki Arimura
Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph. 28-34 - Diego Arroyuelo
Evaluating Regular Path Queries on Compressed Adjacency Matrices. 35-48 - Bastien Auvray, Julien David, Richard Groult, Thierry Lecroq:
Approximate Cartesian Tree Matching: An Approach Using Swaps. 49-61 - Ruben Becker
Optimal Wheeler Language Recognition. 62-74 - Guillaume Blin
Approximation and Fixed Parameter Algorithms for the Approximate Cover Problem. 75-88 - Paola Bonizzoni
Data Structures for SMEM-Finding in the PBWT. 89-101 - Lorenzo Carfagna
Compressibility Measures for Two-Dimensional Data. 102-113 - Adam Cicherski
From de Bruijn Graphs to Variation Graphs - Relationships Between Pangenome Models. 114-128 - Alessio Conte
CAGE: Cache-Aware Graphlet Enumeration. 129-142 - Nicola Cotumaccio
Space-Time Trade-Offs for the LCP Array of Wheeler DFAs. 143-156 - Diego Díaz-Domínguez
Computing All-vs-All MEMs in Grammar-Compressed Text. 157-170 - Jonas Ellert
Sublinear Time Lempel-Ziv (LZ77) Factorization. 171-187 - Jonas Ellert
New Advances in Rightmost Lempel-Ziv. 188-202 - Paolo Ferragina
Engineering a Textbook Approach to Index Massive String Dictionaries. 203-217 - Éric Fusy, Gregory Kucherov
Count-Min Sketch with Variable Number of Hash Functions: An Experimental Study. 218-232 - Travis Gagie
Dynamic Compact Planar Embeddings. 233-245 - Travis Gagie
A Simple Grammar-Based Index for Finding Approximately Longest Common Substrings. 246-252 - Pawel Gawrychowski, Maria Kosche, Florin Manea:
On the Number of Factors in the LZ-End Factorization. 253-259 - Daniel Gibney
Non-overlapping Indexing in BWT-Runs Bounded Space. 260-270 - Haruki Ideguchi, Diptarama Hendrian
Efficient Parameterized Pattern Matching in Sublinear Space. 271-283 - Kaisei Kishi, Yuto Nakashima
Largest Repetition Factorization of Fibonacci Words. 284-296 - Lukasz Kondraciuk
String Covers of a Tree Revisited. 297-309 - Benjamín Letelier
Compacting Massive Public Transport Data. 310-322 - Zsuzsanna Lipták
Constant Time and Space Updates for the Sigma-Tau Problem. 323-330 - Kouta Okabe, Takuya Mieno
Linear-Time Computation of Generalized Minimal Absent Words for Multiple Strings. 331-344 - Solon P. Pissis, Michael Shekelyan, Chang Liu, Grigorios Loukides:
Frequency-Constrained Substring Complexity. 345-352 - Nicola Rizzo
Chaining of Maximal Exact Matches in Graphs. 353-366 - Lusheng Wang
Algorithms and Hardness for the Longest Common Subsequence of Three Strings and Related Problems. 367-380 - Igor O. Zavadskyi
Binary Mixed-Digit Data Compression Codes. 381-392
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 2024-10-02 20:31 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: