32 citations · 58 across the 8 of their papers we have counts for
9 papers
Grammar-Compressed Indexes with Logarithmic Search Time
Francisco Claude, Gonzalo Navarro, Alejandro Pacheco
Let a text be the only string generated by a context-free grammar with (terminal and nonterminal) symbols, and of size (measured as the sum of the lengths of the…
On the Reproducibility of Experiments of Indexing Repetitive Document Collections
Antonio Fariña, Miguel A. Martínez-Prieto, Francisco Claude +4
This work introduces a companion reproducible paper with the aim of allowing the exact replication of the methods, experiments, and results discussed in a previous work [5]. In tha…
Universal Indexes for Highly Repetitive Document Collections
Francisco Claude, Antonio Fariña, Miguel A. Martínez-Prieto +1
Indexing highly repetitive collections has become a relevant problem with the emergence of large repositories of versioned documents, among other applications. These collections ma…
Efficient Compressed Wavelet Trees over Large Alphabets
Francisco Claude, Gonzalo Navarro, Alberto Ordóñez
The {\em wavelet tree} is a flexible data structure that permits representing sequences of symbols over an alphabet of size , within compressed space and supporting a w…
Compact Binary Relation Representations with Rich Functionality
Jérémy Barbay, Francisco Claude, Gonzalo Navarro
Binary relations are an important abstraction arising in many data representation problems. The data structures proposed so far to represent them support just a few basic operation…
Improved Grammar-Based Compressed Indexes
Francisco Claude, Gonzalo Navarro
We introduce the first grammar-compressed representation of a sequence that supports searches in time that depends only logarithmically on the size of the grammar. Given a text $T[…
Compressed String Dictionaries
Nieves R. Brisaboa, Rodrigo Cánovas, Miguel A. Martínez-Prieto +1
The problem of storing a set of strings --- a string dictionary --- in compact form appears naturally in many cases. While classically it has represented a small part of the whole…
Re-Pair Compression of Inverted Lists
Francisco Claude, Antonio Farina, Gonzalo Navarro
Compression of inverted lists with methods that support fast intersection operations is an active research topic. Most compression schemes rely on encoding differences between cons…
Fast In-Memory XPath Search over Compressed Text and Tree Indexes
A. Arroyuelo, F. Claude, S. Maneth +5
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate…