Rizzo, Nicola

Finding Maximal Exact Matches in Graphs

2022 · arXiv (Cornell University)

The problem of String Matching to Labeled Graphs (SMLG) asks to find all the paths in a labeled graph $G = (V, E)$ whose spellings match that of an input string $S \in Σ^m$. SMLG …