Roberto Grossi

On the Complexity of String Matching for Graphs

2023 · ACM Transactions on Algorithms

Exact string matching in labeled graphs is the problem of searching paths of a graph G=(V, E) such that the concatenation of their node labels is equal to a given pattern string P [1. m …

Utility-Oriented String Mining

2024 · Society for Industrial and Applied Mathematics eBooks

A string is often provided with numerical scores (utilities) which quantify the importance, interest, profit, or risk of the letters occurring at every position of the string. For example, every DNA fragment produced by modern …

Finding the cyclic covers of a string

2025 · Information Processing Letters

We introduce the concept of cyclic covers, which generalizes the classical notion of covers in strings. Given any string X , a factor W of X is called a cyclic cover if each position of …