Manuel Cáceres

activity

20232026

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2025

Practical colinear chaining on sequences revisited

Nicola Rizzo, Manuel Cáceres, Veli Mäkinen

Colinear chaining is a classical heuristic for sequence alignment and is widely used in modern practical aligners. Jain et al. (J. Comput. Biol. 2022) proposed an $O (n lo g^{3} n)$ t…

cs.DS2025

Maximum Coverage $k$ -Antichains and Chains: A Greedy Approach

Manuel Cáceres, Andreas Grigorjew, Wanchote Po Jiamjitrak +1

Given an acyclic digraph $G = (V, E)$ and a positive integer $k$ , the problem of Maximum Coverage $k$ -Antichains (resp. Chains) denoted as MA- $k$ (resp. MC- $k$ ) asks to find $k$ set…

cs.DS2023

Minimum Path Cover: The Power of Parameterization

Manuel Cáceres, Brendan Mumey, Santeri Toivonen +1

Computing a minimum path cover (MPC) of a directed acyclic graph (DAG) is a fundamental problem with a myriad of applications, including reachability. Although it is known how to s…

Practical colinear chaining on sequences revisited

Maximum Coverage k-Antichains and Chains: A Greedy Approach

Minimum Path Cover: The Power of Parameterization

Maximum Coverage $k$ -Antichains and Chains: A Greedy Approach