34 citations · 94 across the 9 of their papers we have counts for
7 papers · 1 filter
Sorting Genomes by Prefix Double-Cut-and-Joins
Guillaume Fertin, Géraldine Jean, Anthony Labarre
In this paper, we study the problem of sorting unichromosomal linear genomes by prefix double-cut-and-joins (or DCJs) in both the signed and the unsigned settings. Prefix DCJs cut…
Sorting by Prefix Block-Interchanges
Anthony Labarre
We initiate the study of sorting permutations using prefix block-interchanges, which exchange any prefix of a permutation with another non-intersecting interval. The goal is to tra…
The Clever Shopper Problem
Laurent Bulteau, Danny Hermelin, Anthony Labarre +1
We investigate a variant of the so-called "Internet Shopping Problem" introduced by Blazewicz et al. (2010), where a customer wants to buy a list of products at the lowest possible…
Decomposing Cubic Graphs into Connected Subgraphs of Size Three
Laurent Bulteau, Guillaume Fertin, Anthony Labarre +2
Let be the set of connected graphs of size 3. We study the problem of partitioning the edge set of a graph into graphs taken from any non-empty $S'\subs…
Sorting With Forbidden Intermediates
Carlo Comin, Anthony Labarre, Romeo Rizzi +1
A wide range of applications, most notably in comparative genomics, involve the computation of a shortest sorting sequence of operations for a given permutation, where the set of a…
Locating a Tree in a Phylogenetic Network in Quadratic Time
Philippe Gambette, Andreas D. M. Gunawan, Anthony Labarre +2
A fundamental problem in the study of phylogenetic networks is to determine whether or not a given phylogenetic network contains a given phylogenetic tree. We develop a quadratic-t…