5 citations · 13 across the 12 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2022
Cut paths and their remainder structure, with applications
Massimo Cairo, Shahbaz Khan, Romeo Rizzi +3
In a strongly connected graph , a cut arc (also called strong bridge) is an arc whose removal makes the graph no longer strongly connected. Equivalently, there…
cs.DM2020
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…
cs.DM2020
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…