3 citations · 6 across the 7 of their papers we have counts for
6 papers · 1 filter
A general framework for enumerating equivalence classes of solutions
Yishu Wang, Arnaud Mary, Marie-France Sagot +1
When a problem has more than one solution, it is often important, depending on the underlying context, to enumerate (i.e., to list) them all. Even when the enumeration can be done…
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…
Mod/Resc Parsimony Inference
Igor Nor, Danny Hermelin, Sylvain Charlat +4
We address in this paper a new computational biology problem that aims at understanding a mechanism that could potentially be used to genetically manipulate natural insect populati…
A new distance for high level RNA secondary structure comparison
Julien Allali, Marie-France Sagot
We describe an algorithm for comparing two RNA secondary structures coded in the form of trees that introduces two new operations, called node fusion and edge fusion, besides the t…