Membre

Fiche Membre

En un clic !

Thématiques de recherche
Pôles d’expertises
Nos équipes
Formation par la recherche
- Doctorats
- Masters
HDR
Thèses
Publications

Composante(s) d’expertise Pôle associée(s)

SDD

Intégration de donnéesModélisation de systèmes / problèmes / donnéesOptimisation combinatoire / discrète

Expertises équipes

BioinformatiqueBiologie des SystèmesMétagénomiqueModélisation Biologique

Guillaume Fertin

HDR

Enseignant chercheur / Enseignante chercheuse – Professeur / professeure des universités

Equipe :

Employeur : Nantes Université

Expertises :

Algorithmique discrèteComplexité algorithmiqueProtéomique

Coordonnées

Email :

Adresse(s)

Informations non disponibles pour l’instant

Publications déposées sur HAL

Nombre de publications retournées : 155

Revues internationales avec comité de lecture

[1] O. Baudon, G. Fertin, I. Havel. Routing permutations and 2-1 routing requests in the hypercube, in Discrete Applied Mathematics, vol. 113, pp. 43-58,

[2] G. Fertin, E. Godard, A. Raspaud. Minimum feedback vertex set and acyclic coloring, in Information Processing Letters, vol. 84, no. 3, pp. 131-139,

[3] G. Fertin, A. Raspaud, A. Roychowdhury. On the oriented chromatic number of grids, in Information Processing Letters, vol. 85, no. 5, pp. 261-266,

[4] G. Fertin, E. Godard, A. Raspaud. Acyclic and k-distance coloring of the grid, in Information Processing Letters, vol. 87, no. 1, pp. 51-58,

[5] C. Chauve, G. Fertin. On Maximal Instances for the Original Syntenic Distance, in Theoretical Computer Science, vol. 326, pp. 29-43,

[6] G. Fertin, A. Raspaud, B. Reed. Star Coloring of Graphs, in Journal of Graph Theory, vol. 47, no. 3, pp. 163-182,

[7] G. Fertin, A. Raspaud. A Survey of Knödel Graphs, in Discrete Applied Mathematics, vol. 137, no. 2, pp. 173-195,

[8] G. Blin, G. Fertin, R. Rizzi, S. Vialette. What makes the Arc-Preserving Subsequence problem hard ?, in LNCS Transactions on Computational Systems Biology, vol. 2, pp. 1-36,

[9] G. Fertin, A. Raspaud. Acyclic Coloring of Graphs of Maximum Degree $\Delta$, in Discrete Mathematics and Theoretical Computer Science, vol. DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), pp. 389-396, in 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), Berlin, Allemagne, DOI

[10] T. Calamoneri, S. Caminiti, G. Fertin. New Bounds for the L(h,k) Number of Regular Grids, in International Journal of Mobile Network Design and Innovation, vol. 1, no. 2, pp. 92-101,

[11] Z. Zhang, F. Comellas, G. Fertin, L. Rong. High dimensional Apollonian networks, in Journal of Physics A: Mathematical and Theoretical, vol. 39, pp. 1811-1818,

[12] G. Blin, C. Chauve, G. Fertin, R. Rizzi, S. Vialette. Comparing Genomes with Duplications: a Computational Complexity Point of View, in ACM Transactions on Computational Logic, vol. 4, no. 4, pp. 523-534, DOI

[13] G. Blin, G. Fertin, S. Vialette. Extracting Constrained 2-Interval Subsets in 2-Interval Sets, in Theoretical Computer Science, vol. 385, no. 1-3, pp. 241-263,

[14] G. Fertin, A. Raspaud. , in Discrete Mathematics, vol. 307, no. 16, pp. 2132-2140,

[15] G. Fertin, A. Raspaud. , in Discrete Mathematics, vol. 307, no. 16, pp. 2132-2140,

[16] P. Bonizzoni, G. Della Vedova, R. Dondi, G. Fertin, R. Rizzi, S. Vialette. Exemplar Longest Common Subsequence, in ACM Transactions on Computational Logic, vol. 4, no. 4, pp. 535-543,

[17] S. Angibaud, G. Fertin, I. Rusu, S. Vialette. A General Framework for Computing Rearrangement Distances between Genomes with Duplicates, in Journal of Computational Biology, vol. 14, no. 4, pp. 379-393, DOI

[18] G. Blin, G. Fertin, D. Hermelin, S. Vialette. Fixed-Parameter Algorithms For Protein Similarity Search Under mRNA Structure Constraints, in Journal of Discrete Algorithms, vol. 6, no. 4, pp. 618-626,

[19] G. Fertin, A. Raspaud. Acyclic Coloring of Graphs of Maximum Degree Five: Nine Colors are Enough, in Information Processing Letters, vol. 105, no. 2, pp. 65-72,

[20] S. Angibaud, G. Fertin, I. Rusu, A. Thevenin, S. Vialette. Efficient Tools for Computing the Number of Breakpoints and the Number of Adjacencies between two Genomes with Duplicate Genes, in Journal of Computational Biology, vol. 15, no. 8, pp. 1093-1115, DOI

[21] Z. Zhang, F. Comellas, G. Fertin, A. Raspaud, L. Rong, S. Zhou. Vertex labeling and routing in expanded Apollonian networks, in Journal of Physics A: Mathematical and Theoretical, vol. 41, no. 3, pp. 035004,

[22] G. Fertin, R. Rizzi, S. Vialette. Finding Occurrences of Protein Complexes in Protein-Protein Interaction Graphs, in Journal of Discrete Algorithms, vol. 7, no. 1, pp. 90-101,

[23] S. Angibaud, G. Fertin, I. Rusu, A. Thévenin, S. Vialette. On the Approximability of Comparing Genomes with Duplicates, in Journal of Graph Algorithms and Applications, vol. 13, no. 1, pp. 19-53,

[24] G. Fertin, D. Hermelin, R. Rizzi, S. Vialette. Finding Common Structured Patterns in Linear Graphs, in Theoretical Computer Science, vol. 411, no. 26-28, pp. 2475-2486, DOI

[25] M. Fellows, G. Fertin, D. Hermelin, S. Vialette. Upper and lower bounds for finding connected motifs in vertex-colored graphs, in Journal of Computer and System Sciences, vol. 77, no. 4, pp. 799-811, DOI

[26] R. Dondi, G. Fertin, S. Vialette. Complexity issues in Vertex-Colored Graph Pattern Matching, in Journal of Discrete Algorithms, vol. 9, no. 1, pp. 82-99, DOI

[27] L. Bulteau, G. Fertin, M. Jiang, I. Rusu. Tractability and approximability of maximal strip recovery, in Theoretical Computer Science, vol. 440-441, pp. 14-28, DOI

[28] L. Bulteau, G. Fertin, I. Rusu. Sorting by Transpositions is Difficult, in SIAM Journal on Discrete Mathematics, vol. 26, no. 3, pp. 1148-1180, DOI

[29] L. Bulteau, G. Fertin, I. Rusu. Revisiting the Minimum Breakpoint Linearization Problem Theoretical Computer Science, in Theoretical Computer Science, vol. 494, pp. 122-133,

[30] R. Dondi, G. Fertin, S. Vialette. Finding Approximate and Constrained Motifs in Graphs, in Theoretical Computer Science, vol. 483, no. -, pp. 10-21, DOI

[31] L. Bulteau, G. Fertin, I. Rusu. Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms, in Journal of Discrete Algorithms, vol. 19, pp. 1-22,

[32] L. Bulteau, G. Fertin, S. Vialette, R. Rizzi. Some algorithmic results for [2]-sumset covers, in Information Processing Letters, vol. 115, no. 1, pp. 1-5,

[33] G. Fertin, H. Mohamed-Babou, I. Rusu. Path-Driven Orientation of Mixed Graphs, in Discrete Applied Mathematics, vol. 181, pp. 98-108, DOI

[34] L. Bulteau, G. Fertin, I. Rusu. , in Journal of Computer and System Sciences, vol. 81, no. 8, pp. 1556-1574, DOI

[35] C. Negri Lintzmayer, Z. Dias, G. Fertin. Approximation algorithms for sorting by length-weighted prefix and suffix operations, in Theoretical Computer Science, vol. 593, pp. 26-41, DOI

[36] G. Fertin, S. Jamshidi, C. Komusiewicz. Towards an Algorithmic Guide to Spiral Galaxies, in Theoretical Computer Science, pp. 26-39, DOI

[37] G. Fertin, G. Jean, A. Radulescu, I. Rusu. Hybrid de novo tandem repeat detection using short and long reads, in BMC Medical Genomics, vol. 8, no. Suppl 3, pp. S5, DOI

[38] G. Fertin, C. Komusiewicz, H. Mohamed-Babou, I. Rusu. Finding Supported Paths in Heterogeneous Networks, in Algorithms, DOI

[39] L. Bulteau, G. Fertin, E. Tannier. Genome rearrangements with indels in intergenes restrict the scenario space, in BMC Bioinformatics, vol. 17, no. Suppl 14, pp. 426 (7 pages), DOI

[40] L. Bulteau, G. Fertin, C. Komusiewicz. (Prefix) reversal distance for (signed) strings with few blocks or small alphabets, in Journal of Discrete Algorithms, vol. 37, pp. 44-55, DOI

[41] G. Fertin, G. Jean, E. Tannier. Algorithms for computing the double cut and join distance on both gene order and intergenic sizes, in Algorithms for Molecular Biology, vol. 12, pp. 16 (11 pages), DOI

[42] G. Fertin, J. Peters, L. Raabe, C. Xu. Odd Gossiping, in Discrete Applied Mathematics, vol. 216, pp. 550-561, DOI

[43] M. David, G. Fertin, H. Rogniaux, D. Tessier. SpecOMS: A Full Open Modification Search Method Performing All-to-All Spectra Comparisons within Minutes, in Journal of Proteome Research, vol. 16, no. 8, pp. 3030-3038, DOI

[44] C. Negri Lintzmayer, G. Fertin, Z. Dias. Sorting permutations by prefix and suffix rearrangements, in Journal of Bioinformatics and Computational Biology, vol. 15, no. 1, pp. 1-46, DOI

[45] G. Fertin, I. Rusu, S. Vialette. The S-labeling problem: An algorithmic tour, in Discrete Applied Mathematics, vol. 246, pp. 49-61, DOI

[46] G. Fertin, C. Lintzmayer, Z. Dias. Sorting permutations and binary strings by length-weighted rearrangements, in Theoretical Computer Science, vol. 715, pp. 35 – 59, DOI

[47] G. Fertin, F. Hüffner, C. Komusiewicz, M. Sorge. Matching algorithms for assigning orthologs after genome duplication events, in Computational Biology and Chemistry, vol. 74, pp. 379 – 390, DOI

[48] G. Fertin, L. Jankowiak, G. Jean. Prefix and suffix reversals on strings, in Discrete Applied Mathematics, vol. 246, pp. 140 – 153, DOI

[49] G. Fertin, J. Peters. Optimal odd gossiping, in Discrete Applied Mathematics, vol. 247, pp. 53 – 69, DOI

[50] A. Oliveira, G. Fertin, U. Dias, Z. Dias. Sorting signed circular permutations by super short operations, in Algorithms for Molecular Biology, vol. 13, no. 1, DOI

[51] A. Oliveira, G. Jean, G. Fertin, U. Dias, Z. Dias. Super short operations on both gene order and intergenic sizes, in Algorithms for Molecular Biology, vol. 14, no. 1, DOI

[52] A. Oliveira, G. Jean, G. Fertin, K. Brito, L. Bulteau, U. Dias, Z. Dias. Sorting Signed Permutations by Intergenic Reversals, in IEEE/ACM Transactions on Computational Biology and Bioinformatics, DOI

[53] G. Fertin, C. Komusiewicz. Graph Motif Problems Parameterized by Dual, in Journal of Graph Algorithms and Applications, vol. 24, no. 3, pp. 371-396, DOI

[54] K. Brito, G. Jean, G. Fertin, A. Oliveira, U. Dias, Z. Dias. Sorting by Genome Rearrangements on Both Gene Order and Intergenic Sizes, in Journal of Computational Biology, vol. 27, no. 2, pp. 156-174, DOI

[55] A. Oliveira, G. Jean, G. Fertin, K. Brito, U. Dias, Z. Dias. Sorting Permutations by Intergenic Operations, in IEEE/ACM Transactions on Computational Biology and Bioinformatics, pp. 1-1, DOI

[56] L. Bulteau, G. Fertin, G. Jean, C. Komusiewicz. Sorting by Multi-Cut Rearrangements, in Algorithms, vol. 14, no. 6, pp. 169, DOI

[57] G. Fertin, J. Fradin, G. Jean. The Maximum Colorful Arborescence problem: How (computationally) hard can it be?, in Theoretical Computer Science, vol. 852, pp. 104-120, DOI

[58] A. Lysiak, G. Fertin, G. Jean, D. Tessier. Evaluation of open search methods based on theoretical mass spectra comparison, in BMC Bioinformatics, vol. 22, no. 2 (Special Issue), pp. 65, DOI

[59] L. Bulteau, G. Fertin, A. Labarre, R. Rizzi, I. Rusu. Decomposing Subcubic Graphs into Claws, Paths or Triangles, in Journal of Graph Theory, vol. 98, no. 4, pp. 557-588, DOI

[60] A. Oliveira, A. Alexandrino, G. Jean, G. Fertin, U. Dias, Z. Dias. Approximation algorithms for sorting by k-cuts on signed permutations, in Journal of Combinatorial Optimization, vol. 45, no. 6, DOI

[61] A. Alexandrino, A. Oliveira, G. Jean, G. Fertin, U. Dias, Z. Dias. Reversal and Transposition Distance on Unbalanced Genomes Using Intergenic Information, in Journal of Computational Biology, vol. 30, no. 8, pp. 861-876, DOI

[62] G. Siqueira, A. Oliveira, A. Alexandrino, G. Jean, G. Fertin, Z. Dias. Assignment of orthologous genes in unbalanced genomes using cycle packing of adjacency graphs, in Journal of Heuristics, vol. 30, no. 5-6, pp. 269-289, DOI

[63] G. Fertin, G. Jean, A. Labarre. Sorting genomes by prefix double-cut-and-joins, in Theoretical Computer Science, vol. 1024, pp. 114909, DOI

[64] G. Fertin, O. Fontaine, G. Jean, S. Vialette. The Maximum Zero-Sum Partition problem, in Theoretical Computer Science, vol. 1019, pp. 114811, DOI

[65] G. Siqueira, A. Alexandrino, A. Oliveira, G. Jean, G. Fertin, Z. Dias. Partition Based Algorithms for Rearrangement Distances with Flexible Intergenic Regions, in IEEE/ACM Transactions on Computational Biology and Bioinformatics, pp. 1-14, DOI

[66] E. Benoist, G. Fertin, G. Jean. The Exact Subset MultiCover problem, in Theoretical Computer Science, vol. 1024, pp. 114936, DOI

[67] É. Benoist, G. Jean, H. Rogniaux, G. Fertin, D. Tessier. SpecPeptidOMS Directly and Rapidly Aligns Mass Spectra on Whole Proteomes and Identifies Peptides That Are Not Necessarily Tryptic : Implications for Peptidomics, in Journal of Proteome Research, vol. 24, no. 4, pp. 2159-2172, DOI

Revues nationales avec comité de lecture

[68] G. Fertin, R. Labahn. Compounding of Gossip Graphs, in Networks, vol. 36, no. 2, pp. 126–137,

[69] G. Fertin. A Study of Minimum Gossip Graphs, in Discrete Mathematics, vol. 215, no. 1–3, pp. 33–57,

[70] G. Fertin. On the Structure of Minimum Broadcast Digraphs, in Theoretical Computer Science, vol. 245, no. 2, pp. 203–216,

[71] G. Fertin, A. Raspaud. A Survey on Knödel Graphs, in Discrete Applied Mathematics, vol. 137, no. 2, pp. 173–195,

[72] N. Alon, G. Fertin, A. Liestman, T. Shermer, L. Stacho. Factor d-Domatic Colorings of Graphs, in Discrete Mathematics, vol. 262, no. 1–3, pp. 17–25,

Conférences internationales avec comité de lecture et actes

[73] O. Baudon, G. Fertin, I. Havel. Routing permutations in the hypercube, in International Workshop on Graph-Theoretic Concepts in Computer Science WG'99, Ascona, Suisse,

[74] G. Fertin, A. Raspaud, O. Sykora. No-Hole L(p,0)-Labelling of Cycles, Grids and Hypercubes, in 11th International Colloquium on Structural Information & Communication Complexity (SIROCCO 2004), Smolenice, Slovaquie,

[75] G. Blin, G. Fertin, S. Vialette. New Results for the 2-Interval Pattern Problem, in 15th Symposium on Combinatorial Pattern Matching (CPM'04), Istanbul, Turquie,

[76] G. Blin, G. Fertin, C. Chauve. The breakpoint distance for signed sequences, in 1st Conference on Algorithms and Computational Methods for biochemical and Evolutionary Networks (CompBioNets'04), Recife, Brazil, Brésil,

[77] G. Fertin, R. Rizzi, S. Vialette. Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs, in 30th International Symposium on Mathematical Foundations of Computer Science (MFCS'05), Gdansk, Poland, Pologne,

[78] G. Blin, G. Fertin, R. Rizzi, S. Vialette. What Makes the Arc-Preserving Subsequence Problem Hard?, in 5th Int. Workshop on Bioinformatics Research and Applications (IWBRA'05), Atlanta, GA, USA, états-Unis,

[79] G. Blin, G. Fertin, D. Hermelin, S. Vialette. Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints, in 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG'05), Metz, France,

[80] G. Blin, C. Chauve, G. Fertin. Genes Order and Phylogenetic Reconstruction: Application to $\gamma$-Proteobacteria, in 3rd Annual RECOMB Satellite Workshop on Comparative Genomics (RECOMB-CG'05), Dublin, Ireland, Irlande,

[81] C. Chauve, G. Fertin, R. Rizzi, S. Vialette. Genomes containing Duplicates are Hard to compare, in International Workshop on Bioinformatics Research and Applications (IWBRA 2006), Reading, Royaume-Uni,

[82] C. Chauve, G. Fertin, R. Rizzi, S. Vialette. Genomes containing duplicates are hard to compare, in Proc Int. Workshop on Bioinformatics Research and Applications (IWBRA), Reading, UK, Royaume-Uni,

[83] P. Bonizzoni, G. Della Vedova, R. Dondi, G. Fertin, S. Vialette. Exemplar Longest Common Subsequences, in Int. Workshop on Bioinformatics Research and Applications (IWBRA), états-Unis,

[84] S. Angibaud, G. Fertin, I. Rusu, S. Vialette. How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation, in 4thAnnual RECOMB Satellite Workshop on Comparative Genomics (RECOMB-CG'06), Montreal, Canada, Canada,

[85] P. Bonizzoni, G. Della Vedova, R. Dondi, G. Fertin, S. Vialette. Exemplar Longest Common Subsequence (extended abstract), in International Workshop on Bioinformatics Research and Applications (IWBRA 2006), Reading, Royaume-Uni,

[86] G. Fertin, D. Hermelin, R. Rizzi, S. Vialette. Common Structured Patterns in Linear Graphs: Approximations and Combinatorics, in 18th Annual Symposium on Combinatorial Pattern Matching (CPM 2007), London, Canada,

[87] M. Fellows, G. Fertin, D. Hermelin, S. Vialette. Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs, in 34th International Colloquium on Automata, Languages and Programming (ICALP 2007), Wroclaw, Pologne,

[88] R. Dondi, G. Fertin, S. Vialette. Weak pattern matching in colored graphs: Minimizing the number of connected components, in 10th Italian Conference on Theoretical Computer Science (ICTCS 2007), Rome, Italie,

[89] S. Angibaud, G. Fertin, I. Rusu, A. Thevenin, S. Vialette. A Pseudo-Boolean programming approach for computing the breakpoint distance between two genomes with duplicate genes, in 5th RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG 2007), San Diego, états-Unis,

[90] S. Angibaud, G. Fertin, I. Rusu, S. Vialette. How Pseudo-Boolean Programming can help Genome Rearrangement Distance Computation, in 4th RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG 2006), Montréal, Canada,

[91] G. Blin, G. Fertin, I. Rusu, C. Sinoquet. Extending the Hardness of RNA Secondary Structure Comparison, in 1st International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE 2007), Hangzhou, Chine,

[92] G. Blin, G. Fertin, G. Herry, S. Vialette. Comparing RNA Structures: Towards an Intermediate Model Between the EDIT and the LAPCS Problems, in Brazilian Symposium on Bioinformatics (BSB 2007), Angra dos Reis, Brésil,

[93] S. Angibaud, G. Fertin, I. Rusu. On the Approximability of Comparing Genomes with Duplicates, in 2nd Workshop on Algorithms and Computation (WALCOM 2008), Dhaka, Bangladesh,

[94] F. Cliquet, G. Fertin, I. Rusu, D. Tessier. Comparison of Spectra in Unsequenced Species, in 4th Brazilian Symposium on Bioinformatics (BSB 2009), Porto Alegre, Brésil, DOI

[95] G. Blin, G. Fertin, F. Sikora, S. Vialette. The Exemplar Breakpoint Distance for non-trivial genomes cannot be approximated, in WALCOM 2009, Kolkata, Inde,

[96] G. Fertin, S. Vialette. On the S-labeling Problem, in Proc. 5th Euroconference on Combinatorics, Graph Theory and Applications (EUROCOMB 2009), Bordeaux, France,

[97] I. Fagnot, G. Fertin, S. Vialette. On Finding Small 2-Generating Sets, in COCOON 2009, Niagara Falls, états-Unis, DOI

[98] L. Bulteau, G. Fertin, I. Rusu. Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms, in ISAAC 2009 (20th International Symposium on Algorithms and Computation), Hawaii, états-Unis,

[99] R. Dondi, G. Fertin, S. Vialette. Maximum Motif Problem in Vertex-Colored Graphs, in 20th Annual Symposium on Combinatorial Pattern Matching (CPM 2009), Lille, France, DOI

[100] S. Angibaud, D. Eveillard, G. Fertin, I. Rusu. Comparing Bacterial Genomes by Searching their Common Intervals, in 1st International Conference on Bioinformatics and Computational Biology (BICoB 2009), New Orleans, états-Unis, DOI

[101] S. Angibaud, G. Fertin, A. Thevenin, S. Vialette. Pseudo-Boolean Programming for Partially Ordered Genomes, in RECOMB-CG 2009, Budapest, Hongrie, DOI

[102] L. Bulteau, G. Fertin, I. Rusu. Revisiting the Minimum Breakpoint Linearization Problem, in 7th Annual Conference on Theory and Applications of Models of Computation (TAMC 2010), Prague, France,

[103] F. Cliquet, G. Fertin, I. Rusu, D. Tessier. Proper Alignment of MS/MS Spectra from Unsequenced Species, in 11th International Conference on Bioinformatics and Computational Biology (BIOCOMP 2010), Las Vegas, états-Unis, DOI

[104] G. Blin, G. Fertin, H. Mohamed-Babou, I. Rusu, F. Sikora, S. Vialette. Algorithmic Aspects of Heterogeneous Biological Networks Comparison, in COCOA 2011, Zhangjiajie, Chine, DOI

[105] L. Bulteau, G. Fertin, I. Rusu. Sorting by Transpositions is Difficult, in 38th International Colloquium on Automata, Languages and Programming (ICALP 2011), Zürich, Suisse,

[106] L. Bulteau, G. Fertin, M. Jiang, I. Rusu. Tractability and Approximability of Maximal Strip Recovery, in 22nd Annual Symposium on Combinatorial Pattern Matching (CPM 2011), Palermo, Italie,

[107] R. Dondi, G. Fertin, S. Vialette. Finding Approximate and Constrained Motifs in Graphs, in CPM 2011, Palermo, Italie, DOI

[108] S. Angibaud, P. Bordron, D. Eveillard, G. Fertin, I. Rusu. Integration of omics data to investigate common intervals, in 1st International Conference on Bioscience, Biochemistry and Bioinformatics (ICBBB 2011), Singapore, Singapour,

[109] G. Fertin, H. Mohamed-Babou, I. Rusu. Algorithms for subnetwork mining in heterogeneous networks, in 11th Symposium on Experimental Algorithms (SEA 2012), Bordeaux, France,

[110] L. Bulteau, G. Fertin, I. Rusu. , in 37th International Symposium on Mathematical Foundations of Computer Science (MFCS 2012), Bratislava, Slovaquie,

[111] L. Bulteau, G. Fertin, C. Komusiewicz, I. Rusu. A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications, in 13th Workshop on Algorithms in Bioinformatics (WABI2013), Nice, France, DOI

[112] L. Bulteau, G. Fertin, C. Komusiewicz. Reversal Distances for Strings with Few Blocks or Small Alphabets, in 25th Annual Symposium on Combinatorial Pattern Matching (CPM 2014), Moscou, Russie, DOI

[113] G. Fertin, S. Jamshidi, C. Komusiewicz. Towards an Algorithmic Guide to Spiral Galaxies, in Seventh International Conference on FUN WITH ALGORITHMS (FUN 2014), Lipari, Italie, DOI

[114] G. Fertin, G. Jean, A. Radulescu, I. Rusu. DExTaR: Detection of Exact Tandem Repeats based on the de Bruijn graph, in IEEE International Conference on Bioinformatics and Biomedicine (BIBM 2014), Belfast, Irlande, DOI

[115] G. Fertin, L. Jankowiak, G. Jean. Prefix and Suffix Reversals on Strings, in 22nd International Symposiumon String Processing and Information Retrieval (SPIRE 2015), London, Royaume-Uni, DOI

[116] G. Fertin, I. Rusu, S. Vialette. Algorithmic aspects of the S-Labeling problem, in 26th International Workshop on Combinatorial Algorithms (IWOCA 2015), Verona, Italie,

[117] G. Fertin, I. Rusu, S. Vialette. Obtaining a Triangular Matrix by Independent Row-Column Permutations, in 26th International Symposium on Algorithms and Computation, Nagoya, France, DOI

[118] G. Fertin, G. Jean, E. Tannier. Genome Rearrangements on both Gene Order and Intergenic Regions, in WABI 2016, Aarhus, Danemark,

[119] G. Fertin, C. Komusiewicz. Graph Motif Problems Parameterized by Dual, in 27th Annual Symposium on Combinatorial Pattern Matching, Tel-Aviv, France,

[120] L. Bulteau, G. Fertin, A. Labarre, R. Rizzi, I. Rusu. Decomposing Cubic Graphs into Connected Subgraphs of Size Three, in The 22nd International Computing and Combinatorics Conference (COCOON), Ho Chi Minh City, Viêt Nam, DOI

[121] M. David, G. Fertin, D. Tessier. SpecTrees: An efficient without a priori data structure for MS/MS spectra identification, in 16th International Workshop on Algorithms in Bioinformatics (WABI), Aarhus, Danemark, DOI

[122] L. Bulteau, G. Fertin, C. Komusiewicz. Beyond Adjacency Maximization: Scaffold Filling for New String Distances, in 28th Annual Symposium on Combinatorial Pattern Matching, Warsaw, Pologne, DOI

[123] G. Fertin, J. Fradin, G. Jean. Algorithmic Aspects of the Maximum Colorful Arborescence Problem, in Theory and Applications of Models of Computation – 14th Annual Conference, Berne, Suisse, DOI

[124] G. Fertin, J. Fradin, C. Komusiewicz. On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure, in Annual Symposium on Combinatorial Pattern Matching — CPM 2018, Qingdao, Chine,

[125] A. Rodrigues Oliveira, G. Jean, G. Fertin, U. Dias, Z. Dias. Super Short Reversals on Both Gene Order and Intergenic Sizes, in Advances in Bioinformatics and Computational Biology – 11th Brazilian Symposium on Bioinformatics — BSB 2018, Niteroi, Brésil, DOI

[126] G. Fertin, S. Giraudo, S. Hamel, S. Vialette. Unshuffling Permutations, in TAMC, Kitakyushu, Japon, DOI

[127] K. Brito, G. Jean, G. Fertin, A. Oliveira, U. Dias, Z. Dias. Sorting by Reversals, Transpositions, and Indels on Both Gene Order and Intergenic Sizes, in International Symposium on Bioinformatics Research and Applications ISBRA 2019, Barcelona, Espagne, DOI

[128] L. Bulteau, K. Dabrowski, G. Fertin, M. Johnson, D. Paulusma, S. Vialette. Finding a Small Number of Colourful Components, in CPM 2019, Pise, Italie, DOI

[129] A. Oliveira, G. Jean, G. Fertin, K. Brito, U. Dias, Z. Dias. A 3.5-Approximation Algorithm for Sorting by Intergenic Transpositions, in 7th International Conference, AlCoB 2020 (Algorithms for Computational Biology ), Missoula, états-Unis, DOI

[130] L. Bulteau, G. Fertin, G. Jean, C. Komusiewicz. Sorting by Multi-cut Rearrangements, in SOFSEM 2021, Bolzano-Bozen, Italie, DOI

[131] E. Benoist, G. Fertin, G. Jean. L'Inférence de Protéines à travers le Modèle Peptide Quantity Assignment, in 23ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Villeurbanne – Lyon, France,

[132] A. Rodrigues Oliveira, A. Oliveira Alexandrino, G. Jean, G. Fertin, U. Dias, Z. Dias. Sorting by k-Cuts on Signed Permutations, in Comparative Genomics 19th International Conference, RECOMB-CG 2022, La Jolla, états-Unis, DOI

[133] L. Bulteau, G. Fertin, V. Jugé, S. Vialette. Permutation Pattern Matching for Doubly Partially Ordered Patterns, in 33rd Annual Symposium on Combinatorial Pattern Matching, Prague, République tchèque, DOI

[134] E. Benoist, G. Fertin, G. Jean. The Exact Subset MultiCover Problem, in Theory and Applications of Models of Computation. TAMC 2022, Tianjin, Chine, DOI

[135] G. Fertin, G. Jean, A. Labarre. Sorting Genomes by Prefix Double-Cut-and-Joins, in String Processing and Information Retrieval, 29th International Symposium, SPIRE 2022, Concepcion, Chili, DOI

[136] A. Oliveira Alexandrino, A. Rodrigues Oliveira, G. Jean, G. Fertin, U. Dias, Z. Dias. Transposition Distance Considering Intergenic Regions for Unbalanced Genomes, in Bioinformatics Research and Applications 18th International Symposium, ISBRA 2022, Haifa, Israël, DOI

[137] G. Fertin, O. Fontaine, G. Jean, S. Vialette. The Maximum Zero-Sum Partition Problem, in 25th International Computer Symposium, ICS 2022, Taoyuan, Taïwan, DOI

[138] G. Siqueira, A. Oliveira Alexandrino, A. Rodrigues Oliveira, G. Jean, G. Fertin, Z. Dias. Approximating Rearrangement Distances with Replicas and Flexible Intergenic Regions, in International Symposium on Bioinformatics Research and Applications (ISBRA 2023), Wrocław, Pologne, DOI

[139] G. Fertin, E. Monfroy, C. Vasconcellos-Gaete. Best of Both Worlds: Solving the Cyclic Bandwidth Problem by Combining Pre-existing Knowledge and Constraint Programming Techniques, in International Conference on Computational Science – ICCS 24, Hanoi, Viêt Nam, DOI

[140] A. Berthier, É. Benoist, G. Fertin, G. Jean. GSI: A New Approach to the Protein Inference Problem, in 26th International Conference on Algorithms for Bioinformatics (WABI 2026), L'Aquila, Italie, DOI

Conférences nationales avec comité de lecture et actes

[141] G. Blin, G. Fertin, R. Rizzi, S. Vialette. Pattern Matching in Arc-Annotated Sequences: New Results for the APS Problem, in 5th Journées Ouvertes de Biologie, Informatique et Mathématiques (JOBIM'04), Montréal, Quebec, Canada,

[142] G. Fertin, H. Mohamed-Babou, I. Rusu. On the Complexity of two Problems on Orientations of Mixed Graphs, in In Proc. 5èmes Journées Ouvertes Biologie Informatique Mathématiques (JOBIM 2012), Rennes, France,

Ouvrages – Chapitres d'ouvrages et directions d'ouvrages

[143] G. Fertin, A. Labarre, I. Rusu, E. Tannier, S. Vialette. Combinatorics of Genome Rearrangements,

[144] G. Fertin, I. Rusu. Computing Genomic Distances: An Algorihtmic Viewpoint, DOI

[145] G. Fertin, R. Dondi, G. Mauri. Algorithmic Aspects in Information and Management 11th International Conference, AAIM 2016, Bergamo, Italy, July 18-20, 2016, Proceedings,

[146] H. Déprés, G. Fertin, E. Monfroy. Improved Lower Bounds for the Cyclic Bandwidth Problem, DOI

Autres publications

[147] T. Calamoneri, S. Caminiti, G. Fertin. New Bounds for the L(h, k) Number of Regular Grids,

[148] S. Angibaud, G. Fertin, I. Rusu, A. Thevenin, S. Vialette. On the Approximability of Comparing Genomes with Duplicates,

[149] R. Dondi, G. Fertin, G. Mauri. Editorial, in Theoretical Computer Science, vol. 717, DOI

[150] L. Bulteau, K. Dabrowski, G. Fertin, M. Johnson, D. Paulusma, S. Vialette. Finding a Small Number of Colourful Components, DOI

[151] G. Fertin, M. David, H. Rogniaux, D. Tessier. Mass Spectra Interpretation and the Interest of SpecFit for Identifying Uncommon Modifications, in 16th International Meeting, CIBB 2019, Bergamo, Italy, September 4–6, 2019, DOI

[152] A. Lysiak, G. Fertin, G. Jean, D. Tessier. Detection of multiple modifications in mass spectra without any a priori, in 69th ASMS Conference on Mass Spectrometry and Allied Topics, Philadelphia (PA), états-Unis,

[153] A. Lysiak, G. Fertin, G. Jean, D. Tessier. SpecGlob: rapid and accurate alignment of mass spectra differing from their peptide models by several unknown modifications, DOI

[154] A. Berthier, E. Benoist, G. Fertin, G. Jean, H. Rogniaux. Global Spectrum Interpretation (GSI): A global, integrative approach for the protein inference problem, in EuPA 2025, Saint-Malo, France,

[155] E. Benoist, G. Jean, H. Rogniaux, G. Fertin, D. Tessier. SpecPeptidOMS allows fast and without a priori peptide identification in a peptidomics context., in EuPA conference, Saint-Malo, France,

Pas de projets référencées pour l’instant

Pas de plateformes référencées pour l’instant

Pas de logiciels de référencés pour l’instant