How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation. - Sébastien Angibaud; Guillaume Fertin; Irena Rusu; Stéphane Vialette (Comparative Genomics, 2006)

A Pseudo-boolean Programming Approach for Computing the Breakpoint Distance Between Two Genomes with Duplicate Genes. - Sébastien Angibaud; Guillaume Fertin; Irena Rusu; Annelyse Thévenin; Stéphane Vialette (RECOMB-CG, 2007)

A Pseudo-Boolean Framework for Computing Rearrangement Distances between Genomes with Duplicates. - Sébastien Angibaud; Guillaume Fertin; Irena Rusu; Stéphane Vialette (J. Comput. Biol., 2007)

On the Approximability of Comparing Genomes with Duplicates. - Sébastien Angibaud; Guillaume Fertin; Irena Rusu (WALCOM, 2008)

Efficient Tools for Computing the Number of Breakpoints and the Number of Adjacencies between Two Genomes with Duplicate Genes. - Sébastien Angibaud; Guillaume Fertin; Irena Rusu; Annelyse Thévenin; Stéphane Vialette (J. Comput. Biol., 2008)

Comparing Bacterial Genomes by Searching Their Common Intervals. - Sébastien Angibaud; Damien Eveillard; Guillaume Fertin; Irena Rusu (BICoB, 2009)

Pseudo Boolean Programming for Partially Ordered Genomes. - Sébastien Angibaud; Guillaume Fertin; Annelyse Thévenin; Stéphane Vialette (RECOMB-CG, 2009)

On the Approximability of Comparing Genomes with Duplicates. - Sébastien Angibaud; Guillaume Fertin; Irena Rusu; Annelyse Thévenin; Stéphane Vialette (J. Graph Algorithms Appl., 2009)

Comparaisons de génomes avec gènes dupliqués : étude théorique et algorithmes. (Comparative genomics with duplicated genes: theoretical study and algorithms). - Sébastien Angibaud (2009)