doi dblp
String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Segovia, Spain, October 7-9, 2019, Proceedings

doi dblp
Approximation Ratios of RePair, LongestMatch and Greedy on Unary Strings
Danny Hucke

doi dblp
Lossless Image Compression Using List Update Algorithms
Arezoo Abdollahi | Neil D. B. Bruce | Shahin Kamali | Rezaul Karim

doi dblp
Rpair: Rescaling RePair with Rsync
Travis Gagie | Tomohiro I | Giovanni Manzini | Gonzalo Navarro | Hiroshi Sakamoto | Yoshimasa Takabatake

doi dblp
Position Bias Estimation for Unbiased Learning-to-Rank in eCommerce Search
Grigor Aslanyan | Utkarsh Porwal

doi dblp
BM25 Beyond Query-Document Similarity
Billel Aklouche | Ibrahim Bounhas | Yahya Slimani

doi dblp
Network-Based Pooling for Topic Modeling on Microblog Content
Anaïs Ollagnier | Hywel T. P. Williams

doi dblp
Bounds and Estimates on the Average Edit Distance
Michele Schimd | Gianfranco Bilardi

doi dblp
Compact Data Structures for Shortest Unique Substring Queries
Takuya Mieno | Dominik Köppl | Yuto Nakashima | Shunsuke Inenaga | Hideo Bannai | Masayuki Takeda

doi dblp
Fast Cartesian Tree Matching
Siwoo Song | Cheol Ryu | Simone Faro | Thierry Lecroq | Kunsoo Park

doi dblp
Inducing the Lyndon Array
Felipe A. Louza | Sabrina Mantaci | Giovanni Manzini | Marinella Sciortino | Guilherme P. Telles

doi dblp
Minimal Absent Words in Rooted and Unrooted Trees
Gabriele Fici | Pawel Gawrychowski

doi dblp
On Longest Common Property Preserved Substring Queries
Kazuki Kai | Yuto Nakashima | Shunsuke Inenaga | Hideo Bannai | Masayuki Takeda | Tomasz Kociumaka

doi dblp
Online Algorithms on Antipowers and Antiperiods
Mai Alzamel | Alessio Conte | Daniele Greco | Veronica Guerrini | Costas S. Iliopoulos | Nadia Pisanti | Nicola Prezza | Giulia Punzi | Giovanna Rosone

doi dblp
Polynomial-Delay Enumeration of Maximal Common Subsequences
Alessio Conte | Roberto Grossi | Giulia Punzi | Takeaki Uno

doi dblp
Searching Runs in Streams
Oleg Merkurev | Arseny M. Shur

doi dblp
Weighted Shortest Common Supersequence Problem Revisited
Panagiotis Charalampopoulos | Tomasz Kociumaka | Solon P. Pissis | Jakub Radoszewski | Wojciech Rytter | Juliusz Straszynski | Tomasz Walen | Wiktor Zuba

doi dblp
Fast Identification of Heavy Hitters by Cached and Packed Group Testing
Yusaku Kaneta | Takeaki Uno | Hiroki Arimura

doi dblp
Range Shortest Unique Substring Queries
Paniz Abedin | Arnab Ganguly | Solon P. Pissis | Sharma V. Thankachan

doi dblp
An Optimal Algorithm to Find Champions of Tournament Graphs
Lorenzo Beretta | Franco Maria Nardini | Roberto Trani | Rossano Venturini

doi dblp
A New Linear-Time Algorithm for Centroid Decomposition
Davide Della Giustina | Nicola Prezza | Rossano Venturini

doi dblp
COBS: A Compact Bit-Sliced Signature Index
Timo Bingmann | Phelim Bradley | Florian Gauger | Zamin Iqbal

doi dblp
An Index for Sequencing Reads Based on the Colored de Bruijn Graph
Diego Díaz-Domínguez

doi dblp
Linear Time Maximum Segmentation Problems in Column Stream Model
Bastien Cazaux | Dmitry Kosolobov | Veli Mäkinen | Tuukka Norri

doi dblp
Space-Efficient Merging of Succinct de Bruijn Graphs
Lavinia Egidi | Felipe A. Louza | Giovanni Manzini

doi dblp
Run-Length Encoding in a Finite Universe
N. Jesper Larsson

doi dblp
On the Computation of Longest Previous Non-overlapping Factors
Enno Ohlebusch | Pascal Weber

doi dblp
Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets
Noriki Fujisato | Yuto Nakashima | Shunsuke Inenaga | Hideo Bannai | Masayuki Takeda

doi dblp
Parallel External Memory Wavelet Tree and Wavelet Matrix Construction
Jonas Ellert | Florian Kurpicz

doi dblp
SACABench: Benchmarking Suffix Array Construction
Johannes Bahne | Nico Bertram | Marvin Böcker | Jonas Bode | Johannes Fischer | Hermann Foot | Florian Grieskamp | Florian Kurpicz | Marvin Löbel | Oliver Magiera | Rosa Pink | David Piper | Christopher Poeplau

doi dblp
Faster Dynamic Compressed d-ary Relations
Diego Arroyuelo | Guillermo de Bernardo | Travis Gagie | Gonzalo Navarro

doi dblp
Faster Repetition-Aware Compressed Suffix Trees Based on Block Trees
Manuel Cáceres | Gonzalo Navarro

doi dblp
A Practical Alphabet-Partitioning Rank/Select Data Structure
Diego Arroyuelo | Erick Sepúlveda

doi dblp
Adaptive Succinctness
Diego Arroyuelo | Rajeev Raman

doi dblp
Fast, Small, and Simple Document Listing on Repetitive Text Collections
Dustin Cobas | Gonzalo Navarro

doi dblp
Implementing the Topological Model Succinctly
José Fuentes-Sepúlveda | Gonzalo Navarro | Diego Seco

doi dblp
Space- and Time-Efficient Storage of LiDAR Point Clouds
Susana Ladra | Miguel R. Luaces | José R. Paramá | Fernando Silva-Coira