3 citations · 6 across the 7 of their papers we have counts for
10 papers
Cophylogeny Reconstruction Allowing for Multiple Associations Through Approximate Bayesian Computation
Blerina Sinaimeri, Laura Urbini, Marie-France Sagot +1
Phylogenetic tree reconciliation is employed for the examination of coevolution between host and symbiont species. An important concern is the requirement for dependable cost value…
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…
Geometric medians in reconciliation spaces
Katharina T. Huber, Vincent Moulton, Marie-France Sagot +1
In evolutionary biology, it is common to study how various entities evolve together, for example, how parasites coevolve with their host, or genes with their species. Coevolution i…
Incremental complexity of a bi-objective hypergraph transversal problem
Ricardo Andrade, Etienne Birmelé, Arnaud Mary +2
The hypergraph transversal problem has been intensively studied, from both a theoretical and a practical point of view. In particular , its incremental complexity is known to be qu…
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…