13 citations · 26 across the 11 of their papers we have counts for
5 papers · 1 filter
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…
Wheeler Languages
Jarno Alanko, Giovanna D'Agostino, Alberto Policriti +1
The recently introduced class of Wheeler graphs, inspired by the Burrows-Wheeler Transform (BWT) of a given string, admits an efficient index data structure for searching for subpa…