Main » SPIRE » 2021 »

String Processing and Information Retrieval - 28th International Symposium, SPIRE 2021, Lille, France, October 4-6, 2021, Proceedings

Thierry Lecroq, Hélène Touzet (Editors)


Anthology ID:
2021.spire_conference-2021
Year:
2021
Venue:
spire_conference
Publisher:
Springer
URL:
https://doi.org/10.1007/978-3-030-86692-1
DOI:
10.1007/978-3-030-86692-1
DBLP:
conf/spire/2021
BibTeX:
Download

doi dblp
String Processing and Information Retrieval - 28th International Symposium, SPIRE 2021, Lille, France, October 4-6, 2021, Proceedings

doi dblp
r-Indexing the eBWT
Christina Boucher | Davide Cenzato | Zsuzsanna Lipták | Massimiliano Rossi | Marinella Sciortino

doi dblp
Unicode at Gigabytes per Second
Daniel Lemire

doi dblp
Longest Common Rollercoasters
Kosuke Fujita | Yuto Nakashima | Shunsuke Inenaga | Hideo Bannai | Masayuki Takeda

doi dblp
Minimal Unique Palindromic Substrings After Single-Character Substitution
Mitsuru Funakoshi | Takuya Mieno

doi dblp
Permutation-Constrained Common String Partitions with Applications
Manuel Lafond | Binhai Zhu

doi dblp
All Instantiations of the Greedy Algorithm for the Shortest Common Superstring Problem are Equivalent
Maksim S. Nikolaev

doi dblp
String Covers of a Tree
Jakub Radoszewski | Wojciech Rytter | Juliusz Straszynski | Tomasz Walen | Wiktor Zuba

doi dblp
Grammar Index by Induced Suffix Sorting
Tooru Akagi | Dominik Köppl | Yuto Nakashima | Shunsuke Inenaga | Hideo Bannai | Masayuki Takeda

doi dblp
An LMS-Based Grammar Self-index with Local Consistency Properties
Diego Díaz-Domínguez | Gonzalo Navarro | Alejandro Pacheco

doi dblp
On the Approximation Ratio of LZ-End to LZ77
Takumi Ideue | Takuya Mieno | Mitsuru Funakoshi | Yuto Nakashima | Shunsuke Inenaga | Masayuki Takeda

doi dblp
Computing the Original eBWT Faster, Simpler, and with Less Memory
Christina Boucher | Davide Cenzato | Zsuzsanna Lipták | Massimiliano Rossi | Marinella Sciortino

doi dblp
Extracting the Sparse Longest Common Prefix Array from the Suffix Binary Search Tree
Tomohiro I | Robert W. Irving | Dominik Köppl | Lorna Love

doi dblp
findere: Fast and Precise Approximate Membership Query
Lucas Robidou | Pierre Peterlongo

doi dblp
A Separation of γ and b via Thue-Morse Words
Hideo Bannai | Mitsuru Funakoshi | Tomohiro I | Dominik Köppl | Takuya Mieno | Takaaki Nishimoto

doi dblp
Lower Bounds for the Number of Repetitions in 2D Strings
Pawel Gawrychowski | Samah Ghazawi | Gad M. Landau

doi dblp
On Stricter Reachable Repetitiveness Measures
Gonzalo Navarro | Cristian Urbina

doi dblp
Improved Topic Modeling in Twitter Through Community Pooling
Federico Albanese | Esteban Feuerstein

doi dblp
TSXor: A Simple Time Series Compression Algorithm
Andrea Bruno | Franco Maria Nardini | Giulio Ermanno Pibiri | Roberto Trani | Rossano Venturini

doi dblp
Exploiting Pseudo-locality of Interchange Distance
Avivit Levy

doi dblp
Position Heaps for Cartesian-Tree Matching on Strings and Tries
Akio Nishimoto | Noriki Fujisato | Yuto Nakashima | Shunsuke Inenaga