13 citations · 26 across the 11 of their papers we have counts for
28 papers · 1 filter
Linear-time Minimization of Wheeler DFAs
Jarno Alanko, Nicola Cotumaccio, Nicola Prezza
Wheeler DFAs (WDFAs) are a sub-class of finite-state automata which is playing an important role in the emerging field of compressed data structures: as opposed to general automata…
HOLZ: High-Order Entropy Encoding of Lempel-Ziv Factor Distances
Dominik Köppl, Gonzalo Navarro, Nicola Prezza
We propose a new representation of the offsets of the Lempel-Ziv (LZ) factorization based on the co-lexicographic order of the processed prefixes. The selected offsets tend to appr…
Subpath Queries on Compressed Graphs: a Survey
Nicola Prezza
Text indexing is a classical algorithmic problem that has been studied for over four decades: given a text , pre-process it off-line so that, later, we can quickly count and loc…
Adaptive Learning of Compressible Strings
Gabriele Fici, Nicola Prezza, Rossano Venturini
Suppose an oracle knows a string that is unknown to us and that we want to determine. The oracle can answer queries of the form "Is a substring of ?". In 1995, Skiena an…
On Indexing and Compressing Finite Automata
Nicola Cotumaccio, Nicola Prezza
An index for a finite automaton is a powerful data structure that supports locating paths labeled with a query pattern, thus solving pattern matching on the underlying regular lang…
On Locating Paths in Compressed Tries
Nicola Prezza
In this paper, we consider the problem of compressing a trie while supporting the powerful \emph{locate} queries: to return the pre-order identifiers of all nodes reached by a path…