8 citations · 8 across the 7 of their papers we have counts for
8 papers
Computing Smallest Suffixient Arrays in Sublinear Time
Hiroto Fujimaru, Gonzalo Navarro, Francisco Olivares +3
A suffixient array is a novel data structure that, when combined with an index providing direct access on a text , allows us to answer a variety of pattern matching queries. In…
Practical Linear-Time Computation of Smallest Suffixient Sets
Francisco Olivares, Gonzalo Navarro
Suffixient arrays are recent structures that have attracted attention because they offer relevant pattern matching functionality in less asymptotic space than the Run-Length BWT, t…
Optimal-Time Contextual Pattern Matching in Compressed Space
Gonzalo Navarro, Francisco Olivares
Contextual pattern matching is the task of, given a pattern , a context length , and a text , find all the distinct contexts in which occurs in , th…
Generalized Straight-Line Programs
Gonzalo Navarro, Francisco Olivares, Cristian Urbina
It was recently proved that any Straight-Line Program (SLP) generating a given string can be transformed in linear time into an equivalent balanced SLP of the same asymptotic size.…
Sorting Finite Automata via Partition Refinement
Ruben Becker, Manuel Cáceres, Davide Cenzato +4
Wheeler nondeterministic finite automata (WNFAs) were introduced as a generalization of prefix sorting from strings to labeled graphs. WNFAs admit optimal solutions to classic hard…
Faster Prefix-Sorting Algorithms for Deterministic Finite Automata
Sung-Hwan Kim, Francisco Olivares, Nicola Prezza
Sorting is a fundamental algorithmic pre-processing technique which often allows to represent data more compactly and, at the same time, speeds up search queries on it. In this pap…
Balancing Run-Length Straight-Line Programs*
Gonzalo Navarro, Francisco Olivares, Cristian Urbina
It was recently proved that any SLP generating a given string can be transformed in linear time into an equivalent balanced SLP of the same asymptotic size. We show that this r…
Near-Optimal Search Time in -Optimal Space, and Vice Versa
Tomasz Kociumaka, Gonzalo Navarro, Francisco Olivares
Two recent lower bounds on the compressibility of repetitive sequences, , have received much attention. It has been shown that a length- string over an alphabet of s…