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
r-Indexing the eBWT
Christina Boucher
|
Davide Cenzato
|
Zsuzsanna Lipták
|
Massimiliano Rossi
|
Marinella Sciortino
Unicode at Gigabytes per Second
Daniel Lemire
Longest Common Rollercoasters
Kosuke Fujita
|
Yuto Nakashima
|
Shunsuke Inenaga
|
Hideo Bannai
|
Masayuki Takeda
Minimal Unique Palindromic Substrings After Single-Character Substitution
Mitsuru Funakoshi
|
Takuya Mieno
Permutation-Constrained Common String Partitions with Applications
Manuel Lafond
|
Binhai Zhu
All Instantiations of the Greedy Algorithm for the Shortest Common Superstring Problem are Equivalent
Maksim S. Nikolaev
String Covers of a Tree
Jakub Radoszewski
|
Wojciech Rytter
|
Juliusz Straszynski
|
Tomasz Walen
|
Wiktor Zuba
Grammar Index by Induced Suffix Sorting
Tooru Akagi
|
Dominik Köppl
|
Yuto Nakashima
|
Shunsuke Inenaga
|
Hideo Bannai
|
Masayuki Takeda
An LMS-Based Grammar Self-index with Local Consistency Properties
Diego Díaz-Domínguez
|
Gonzalo Navarro
|
Alejandro Pacheco
On the Approximation Ratio of LZ-End to LZ77
Takumi Ideue
|
Takuya Mieno
|
Mitsuru Funakoshi
|
Yuto Nakashima
|
Shunsuke Inenaga
|
Masayuki Takeda
Computing the Original eBWT Faster, Simpler, and with Less Memory
Christina Boucher
|
Davide Cenzato
|
Zsuzsanna Lipták
|
Massimiliano Rossi
|
Marinella Sciortino
Extracting the Sparse Longest Common Prefix Array from the Suffix Binary Search Tree
Tomohiro I
|
Robert W. Irving
|
Dominik Köppl
|
Lorna Love
findere: Fast and Precise Approximate Membership Query
Lucas Robidou
|
Pierre Peterlongo
A Separation of γ and b via Thue-Morse Words
Hideo Bannai
|
Mitsuru Funakoshi
|
Tomohiro I
|
Dominik Köppl
|
Takuya Mieno
|
Takaaki Nishimoto
Lower Bounds for the Number of Repetitions in 2D Strings
Pawel Gawrychowski
|
Samah Ghazawi
|
Gad M. Landau
On Stricter Reachable Repetitiveness Measures
Gonzalo Navarro
|
Cristian Urbina
Improved Topic Modeling in Twitter Through Community Pooling
Federico Albanese
|
Esteban Feuerstein
TSXor: A Simple Time Series Compression Algorithm
Andrea Bruno
|
Franco Maria Nardini
|
Giulio Ermanno Pibiri
|
Roberto Trani
|
Rossano Venturini
Exploiting Pseudo-locality of Interchange Distance
Avivit Levy
Position Heaps for Cartesian-Tree Matching on Strings and Tries
Akio Nishimoto
|
Noriki Fujisato
|
Yuto Nakashima
|
Shunsuke Inenaga