3 citations · 6 across the 7 of their papers we have counts for
3 papers · 1 filter
Efficiently listing bounded length st-paths
Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot
The problem of listing the shortest simple (loopless) -paths in a graph has been studied since the early 1960s. For a non-negatively weighted graph with vertices and $m…
Amortized -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs
Rui Ferreira, Roberto Grossi, Romeo Rizzi +2
Chordless cycles are very natural structures in undirected graphs, with an important history and distinguished role in graph theory. Motivated also by previous work on the classica…
Navigating in a sea of repeats in RNA-seq without drowning
Gustavo Sacomoto, Blerina Sinaimeri, Camille Marchet +3
The main challenge in de novo assembly of NGS data is certainly to deal with repeats that are longer than the reads. This is particularly true for RNA- seq data, since coverage inf…