4 citations · 5 across the 3 of their papers we have counts for
6 papers
Minimum Chain Cover in Almost Linear Time
Manuel Caceres
A minimum chain cover (MCC) of a -width directed acyclic graph (DAG) is a set of chains (paths in the transitive closure) of such that every vertex appears…
Chaining of Maximal Exact Matches in Graphs
Nicola Rizzo, Manuel Cáceres, Veli Mäkinen
We show how to chain maximal exact matches (MEMs) between a query string and a labeled directed acyclic graph (DAG) to solve the longest common subsequence (LCS) prob…
Parameterized Algorithms for String Matching to DAGs: Funnels and Beyond
Manuel Caceres
The problem of String Matching to Labeled Graphs (SMLG) asks to find all the paths in a labeled graph whose spellings match that of an input string . SMLG c…
Minimum Path Cover in Parameterized Linear Time
Manuel Caceres, Massimo Cairo, Brendan Mumey +2
A minimum path cover (MPC) of a directed acyclic graph (DAG) is a minimum-size set of paths that together cover all the vertices of the DAG. Computing an MPC is a basic…
Fast Indexes for Gapped Pattern Matching
Manuel Cáceres, Simon J. Puglisi, Bella Zhukova
We describe indexes for searching large data sets for variable-length-gapped (VLG) patterns. VLG patterns are composed of two or more subpatterns, between each adjacent pair of whi…
Faster Repetition-Aware Compressed Suffix Trees based on Block Trees
Manuel Cáceres, Gonzalo Navarro
Suffix trees are a fundamental data structure in stringology, but their space usage, though linear, is an important problem for its applications. We design and implement a new comp…