 | 2009 |
|---|
| 9 |       | Sébastien Angibaud,
Damien Eveillard,
Guillaume Fertin,
Irena Rusu:
Comparing Bacterial Genomes by Searching Their Common Intervals.
BICoB 2009: 102-113 |
| 8 | | Sébastien Angibaud,
Guillaume Fertin,
Annelyse Thévenin,
Stéphane Vialette:
Pseudo Boolean Programming for Partially Ordered Genomes.
RECOMB-CG 2009: 126-137 |
| 7 | | Sébastien Angibaud,
Guillaume Fertin,
Irena Rusu,
Annelyse Thévenin,
Stéphane Vialette:
On the Approximability of Comparing Genomes with Duplicates.
J. Graph Algorithms Appl. 13(1): 19-53 (2009) |
| 2008 |
|---|
| 6 | | Sébastien Angibaud,
Guillaume Fertin,
Irena Rusu:
On the Approximability of Comparing Genomes with Duplicates.
WALCOM 2008: 34-45 |
| 5 | | Sébastien Angibaud,
Guillaume Fertin,
Irena Rusu,
Annelyse Thévenin,
Stéphane Vialette:
On the Approximability of Comparing Genomes with Duplicates
CoRR abs/0806.1103: (2008) |
| 4 | | Sébastien Angibaud,
Guillaume Fertin,
Irena Rusu,
Annelyse Thévenin,
Stéphane Vialette:
Efficient Tools for Computing the Number of Breakpoints and the Number of Adjacencies between Two Genomes with Duplicate Genes.
Journal of Computational Biology 15(8): 1093-1115 (2008) |
| 2007 |
|---|
| 3 | | Sébastien Angibaud,
Guillaume Fertin,
Irena Rusu,
Annelyse Thévenin,
Stéphane Vialette:
A Pseudo-boolean Programming Approach for Computing the Breakpoint Distance Between Two Genomes with Duplicate Genes.
RECOMB-CG 2007: 16-29 |
| 2 | | Sébastien Angibaud,
Guillaume Fertin,
Irena Rusu,
Stéphane Vialette:
A Pseudo-Boolean Framework for Computing Rearrangement Distances between Genomes with Duplicates.
Journal of Computational Biology 14(4): 379-393 (2007) |
| 2006 |
|---|
| 1 | | Sébastien Angibaud,
Guillaume Fertin,
Irena Rusu,
Stéphane Vialette:
How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation.
Comparative Genomics 2006: 75-86 |
Data released under the ODC-BY 1.0 license — See also our legal information page