1 citations · 1 across the 2 of their papers we have counts for
4 papers
Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time
Manuel Cáceres, 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…
The Hydrostructure: a Universal Framework for Safe and Complete Algorithms for Genome Assembly
Massimo Cairo, Shahbaz Khan, Romeo Rizzi +3
Genome assembly is a fundamental problem in Bioinformatics, requiring to reconstruct a source genome from an assembly graph built from a set of reads (short strings sequenced from…
Computing all - bridges and articulation points simplified
Massimo Cairo, Shahbaz Khan, Romeo Rizzi +3
Given a directed graph and a pair of nodes and , an - bridge of is an edge whose removal breaks all - paths of . Similarly, an - articulation po…
Genome assembly, from practice to theory: safe, complete and linear-time
Massimo Cairo, Romeo Rizzi, Alexandru I. Tomescu +1
Genome assembly asks to reconstruct an unknown string from many shorter substrings of it. Even though it is one of the key problems in Bioinformatics, it is generally lacking major…