4 citations · 5 across the 3 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.DS2023
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…
cs.DS2023★ 1 cited
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…