Guillaume Fertin
Guillaume Fertin
University of Nantes, LS2N, France
Email verificata su univ-nantes.fr
Titolo
Citata da
Citata da
Anno
Combinatorics of genome rearrangements
G Fertin, A Labarre, I Rusu, S Vialette, E Tannier
MIT press, 2009
3352009
Sorting by transpositions is difficult
L Bulteau, G Fertin, I Rusu
SIAM Journal on Discrete Mathematics 26 (3), 1148-1180, 2012
1972012
Star coloring of graphs
G Fertin, A Raspaud, B Reed
Journal of graph theory 47 (3), 163-182, 2004
1562004
Recursive graphs with small-world scale-free properties
F Comellas, G Fertin, A Raspaud
physical review E 69 (3), 037104, 2004
1292004
High-dimensional Apollonian networks
Z Zhang, F Comellas, G Fertin, L Rong
Journal of Physics A: Mathematical and General 39 (8), 1811, 2006
1132006
Acyclic and k-distance coloring of the grid
G Fertin, E Godard, A Raspaud
Information Processing Letters 87 (1), 51-58, 2003
902003
Pancake flipping is hard
L Bulteau, G Fertin, I Rusu
Journal of Computer and System Sciences 81 (8), 1556-1574, 2015
822015
Upper and lower bounds for finding connected motifs in vertex-colored graphs
MR Fellows, G Fertin, D Hermelin, S Vialette
Journal of Computer and System Sciences 77 (4), 799-811, 2011
802011
Sharp tractability borderlines for finding connected motifs in vertex-colored graphs
MR Fellows, G Fertin, D Hermelin, S Vialette
International Colloquium on Automata, Languages, and Programming, 340-351, 2007
802007
On star coloring of graphs
G Fertin, A Raspaud, B Reed
International Workshop on Graph-Theoretic Concepts in Computer Science, 140-153, 2001
712001
A survey on Knödel graphs
G Fertin, A Raspaud
Discrete Applied Mathematics 137 (2), 173-195, 2004
642004
On the approximability of comparing genomes with duplicates
S Angibaud, G Fertin, I Rusu, A Thévenin, S Vialette
Journal of Graph Algorithms and Applications 13 (1), 19-53, 2009
622009
The breakpoint distance for signed sequences
G Blin, C Chauve, G Fertin
Proc. 1st Algorithms and Computational Methods for Biochemical and …, 2004
592004
Combinatorics of genome rearrangements. Computational molecular biology
G Fertin, A Labarre, I Rusu, É Tannier, S Vialette
MIT Press, 2009
542009
Comparing genomes with duplications: a computational complexity point of view
G Blin, C Chauve, G Fertin, R Rizzi, S Vialette
IEEE/ACM Transactions on Computational Biology and Bioinformatics 4 (4), 523-534, 2007
512007
The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated
G Blin, G Fertin, F Sikora, S Vialette
International Workshop on Algorithms and Computation, 357-368, 2009
452009
Exemplar longest common subsequence
P Bonizzoni, G Della Vedova, R Dondi, G Fertin, R Rizzi, S Vialette
IEEE/ACM Transactions on Computational Biology and Bioinformatics 4 (4), 535-543, 2007
422007
On the oriented chromatic number of grids
G Fertin, A Raspaud, A Roychowdhury
Information Processing Letters 85 (5), 261-266, 2003
422003
Genes order and phylogenetic reconstruction: Application to γ-proteobacteria
G Blin, C Chauve, G Fertin
RECOMB Workshop on Comparative Genomics, 11-20, 2005
402005
Complexity issues in vertex-colored graph pattern matching
R Dondi, G Fertin, S Vialette
Journal of Discrete Algorithms 9 (1), 82-99, 2011
382011
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20