2 citations · 2 across the 5 of their papers we have counts for
7 papers
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…
Computing an Evolutionary Ordering is Hard
Laurent Bulteau, Gustavo Sacomoto, Blerina Sinaimeri
We prove that computing an evolutionary ordering of a family of sets, i.e. an ordering where each set intersects with --but is not included in-- the union earlier sets, is NP-hard.
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…
Efficient Algorithms for de novo Assembly of Alternative Splicing Events from RNA-seq Data
Gustavo Sacomoto
In this thesis, we address the problem of identifying and quantifying variants (alternative splicing and genomic polymorphism) in RNA-seq data when no reference genome is available…
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…
A polynomial delay algorithm for the enumeration of bubbles with length constraints in directed graphs and its application to the detection of alternative splicing in RNA-seq data
Gustavo Sacomoto, Vincent Lacroix, Marie-France Sagot
We present a new algorithm for enumerating bubbles with length constraints in directed graphs. This problem arises in transcriptomics, where the question is to identify all alterna…