Guillaume Fertin
12
Documents
Affiliations actuelles
- 481374
- 1088564
Identifiants chercheurs
- guillaume-fertin
- 0000-0002-8251-2012
- IdRef : 095050612
Publications
- 12
- 12
- 5
- 3
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 2
- 1
- 2
- 2
- 3
- 1
The S-labeling problem: An algorithmic tourDiscrete Applied Mathematics, 2018, 246, pp.49-61. ⟨10.1016/j.dam.2017.07.036⟩
Article dans une revue
hal-01710032v1
|
|
|
On the Approximability of Comparing Genomes with DuplicatesJournal of Graph Algorithms and Applications, 2009, 13 (1), pp.19-53
Article dans une revue
hal-00416440v1
|
|
Efficient Tools for Computing the Number of Breakpoints and the Number of Adjacencies between two Genomes with Duplicate GenesJournal of Computational Biology, 2008, 15 (8), pp.1093-1115. ⟨10.1089/cmb.2008.0061⟩
Article dans une revue
hal-00416446v1
|
|
A General Framework for Computing Rearrangement Distances between Genomes with DuplicatesJournal of Computational Biology, 2007, 14 (4), pp.379-393. ⟨10.1089/cmb.2007.A001⟩
Article dans une revue
hal-00417735v1
|
|
Obtaining a Triangular Matrix by Independent Row-Column Permutations26th International Symposium on Algorithms and Computation, Dec 2015, Nagoya, France. ⟨10.1007/978-3-662-48971-0_15⟩
Communication dans un congrès
hal-01189621v1
|
Algorithmic aspects of the S-Labeling problem26th International Workshop on Combinatorial Algorithms (IWOCA 2015), Oct 2015, Verona, Italy. pp.173-184
Communication dans un congrès
hal-01311584v1
|
|
|
Algorithmic Aspects of Heterogeneous Biological Networks ComparisonCOCOA 2011, 2011, Zhangjiajie, China. pp.272-286, ⟨10.1007/978-3-642-22616-8_22⟩
Communication dans un congrès
hal-00606375v1
|
|
How Pseudo-Boolean Programming can help Genome Rearrangement Distance Computation4th RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG 2006), 2007, Montréal, Canada. pp.75-86
Communication dans un congrès
hal-00418258v1
|
|
A Pseudo-Boolean programming approach for computing the breakpoint distance between two genomes with duplicate genes5th RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG 2007), 2007, San Diego, United States. pp.16-29
Communication dans un congrès
hal-00417902v1
|
How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation4thAnnual RECOMB Satellite Workshop on Comparative Genomics (RECOMB-CG'06), 2006, Montreal, Canada, Canada. pp.75-86
Communication dans un congrès
hal-00619848v1
|
Combinatorics of Genome RearrangementsMIT Press, pp.312, 2009, Computational Molecular Biology, 978-0-262-06282-4
Ouvrages
hal-00416453v1
|
|
On the Approximability of Comparing Genomes with Duplicates2008
Pré-publication, Document de travail
hal-00285511v1
|