
On Stricter Reachable Repetitiveness Measures*
The size b of the smallest bidirectional macro scheme, which is arguably...
read it

A Fast and Small Subsampled Rindex
The rindex (Gagie et al., JACM 2020) represented a breakthrough in comp...
read it

Grammar Compression By Induced Suffix Sorting
A grammar compression algorithm, called GCIS, is introduced in this work...
read it

A grammar compressor for collections of reads with applications to the construction of the BWT
We describe a grammar for DNA sequencing reads from which we can compute...
read it

PHONI: Streamed Matching Statistics with MultiGenome References
Computing the matching statistics of patterns with respect to a text is ...
read it

Contextual Pattern Matching
The research on indexing repetitive string collections has focused on th...
read it

Space/timeefficient RDF stores based on circular suffix sorting
In recent years, RDF has gained popularity as a format for the standardi...
read it

PFP Data Structures
Prefixfree parsing (PFP) was introduced by Boucher et al. (2019) as a p...
read it

Indexing Highly Repetitive String Collections
Two decades ago, a breakthrough in indexing string collections made it p...
read it

GrammarCompressed Indexes with Logarithmic Search Time
Let a text T[1..n] be the only string generated by a contextfree gramma...
read it

Approximating Optimal Bidirectional Macro Schemes
LempelZiv is an easytocompute member of a wide family of socalled ma...
read it

Semantrix: A Compressed Semantic Matrix
We present a compact data structure to represent both the duration and l...
read it

Cell cycle and protein complex dynamics in discovering signaling pathways
Signaling pathways are responsible for the regulation of cell processes,...
read it

On the Reproducibility of Experiments of Indexing Repetitive Document Collections
This work introduces a companion reproducible paper with the aim of allo...
read it

Implementing the Topological Model Succinctly
We show that the topological model, a semantically rich standard to repr...
read it

Grammar Compressed Sequences with Rank/Select Support
Sequence representations supporting not only direct access to their symb...
read it

Faster Dynamic Compressed dary Relations
The k^2tree is a successful compact representation of binary relations ...
read it

Extending General Compact Querieable Representations to GIS Applications
The raster model is commonly used for the representation of images in ma...
read it

Improved Compressed String Dictionaries
We introduce a new family of compressed data structures to efficiently s...
read it

Dv2v: A Dynamic VariabletoVariable Compressor
We present Dv2v, a new dynamic (onepass) variabletovariable compresso...
read it

GraCT: A Grammarbased Compressed Index for Trajectory Data
We introduce a compressed data structure for the storage of free traject...
read it

On dynamic succinct graph representations
We address the problem of representing dynamic graphs using k^2trees. T...
read it

TreeShape Grammars for Random Access
Shape grammars are well known in the graphics and design communities but...
read it

Towards a Definitive Measure of Repetitiveness
Unlike in statistical compression, where Shannon's entropy is a definiti...
read it

Optimal Joins using Compact Data Structures
Worstcase optimal join algorithms have gained a lot of attention in the...
read it

Rpair: Rescaling RePair with Rsync
Data compression is a powerful tool for managing massive but repetitive ...
read it

LempelZivlike Parsing in Small Space
LempelZiv (LZ77 or, briefly, LZ) is one of the most effective and widel...
read it

Fast, Small, and Simple Document Listing on Repetitive Text Collections
Document listing on string collections is the task of finding all docume...
read it

Faster RepetitionAware Compressed Suffix Trees based on Block Trees
Suffix trees are a fundamental data structure in stringology, but their ...
read it

Simulating the DNA String Graph in Succinct Space
Converting a set of sequencing reads into a lossless compact data struct...
read it

Faster AttractorBased Indexes
String attractors are a novel combinatorial object encompassing most kno...
read it

Tunneling on Wheeler Graphs
The BurrowsWheeler Transform (BWT) is an important technique both in da...
read it

Relative compression of trajectories
We present RCT, a new compact data structure to represent trajectories o...
read it

The ReadOptimized BurrowsWheeler Transform
The advent of highthroughput sequencing has resulted in massive genomic...
read it

FullyFunctional Suffix Trees and Optimal Text Searching in BWTruns Bounded Space
Indexing highly repetitive texts  such as genomic databases, software...
read it

Tree Path Majority Data Structures
We present the first solution to τmajorities on tree paths. Given a tre...
read it

Assembling Omnitigs using HiddenOrder de Bruijn Graphs
De novo DNA assembly is a fundamental task in Bioinformatics, and findin...
read it

Universal Compressed Text Indexing
The rise of repetitive datasets has lately generated a lot of interest i...
read it

On the Approximation Ratio of Greedy Parsings
Shannon's entropy is a clear lower bound for statistical compression. Th...
read it

Compact Representations of Event Sequences
We introduce a new technique for the efficient management of large seque...
read it

TwoDimensional Block Trees
The Block Tree (BT) is a novel compact data structure designed to compre...
read it

Text Indexing and Searching in Sublinear Time
We introduce the first index that can be built in o(n) time for a text o...
read it

A Grammar Compression Algorithm based on Induced Suffix Sorting
We introduce GCIS, a grammar compression algorithm based on the induced ...
read it
Gonzalo Navarro
is this you? claim profile