Guillaume Fertin

152
Documents
Affiliations actuelles
  • Combinatoire et Bioinformatique (LS2N - équipe COMBI)
  • Laboratoire des Sciences du Numérique de Nantes (LS2N)
Contact

Publications

48
37
32
24
14
11
10
10
9
9
8
7
7
7
7
6
6
5
5
5
5
5
4
4
4
4
4
3
3
3
3
3
3
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
15
8
5
5
4
4
3
3
2
2
2
2
2
2
2
1
1
1
1
1
1
1
1
1
1
1
4
4
2
9
7
5
5
9
6
7
10
3
4
5
8
3
11
6
12
9
6
7
4
1
1
3
1

Publications

Partition Based Algorithms for Rearrangement Distances with Flexible Intergenic Regions

Gabriel Siqueira , Alexsandro Oliveira Alexandrino , Andre Rodrigues Oliveira , Geraldine Jean , Guillaume Fertin et al.

IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2025, pp.1-14. ⟨10.1109/TCBB.2024.3467033⟩

Article dans une revue hal-04914864v1

The Exact Subset MultiCover problem

Emile Benoist , Guillaume Fertin , Géraldine Jean

Theoretical Computer Science, 2025, 1024, pp.114936. ⟨10.1016/j.tcs.2024.114936⟩

Article dans une revue hal-04914852v1
Deposit thumbnail

SpecPeptidOMS Directly and Rapidly Aligns Mass Spectra on Whole Proteomes and Identifies Peptides That Are Not Necessarily Tryptic : Implications for Peptidomics

Émile Benoist , Géraldine Jean , Hélène Rogniaux , Guillaume Fertin , Dominique Tessier

Journal of Proteome Research, 2025, 24 (4), pp.2159-2172. ⟨10.1021/acs.jproteome.4c00870⟩

Article dans une revue hal-05175395v1
Deposit thumbnail

Sorting genomes by prefix double-cut-and-joins

Guillaume Fertin , Géraldine Jean , Anthony Labarre

Theoretical Computer Science, 2024, 1024, pp.114909. ⟨10.1016/j.tcs.2024.114909⟩

Article dans une revue hal-04901649v1

Assignment of orthologous genes in unbalanced genomes using cycle packing of adjacency graphs

Gabriel Siqueira , Andre Rodrigues Oliveira , Alexsandro Oliveira Alexandrino , Géraldine Jean , Guillaume Fertin et al.

Journal of Heuristics, 2024, 30 (5-6), pp.269-289. ⟨10.1007/s10732-024-09528-z⟩

Article dans une revue hal-04914835v1
Deposit thumbnail

The Maximum Zero-Sum Partition problem

Guillaume Fertin , Oscar Fontaine , Géraldine Jean , Stéphane Vialette

Theoretical Computer Science, 2024, 1019, pp.114811. ⟨10.1016/j.tcs.2024.114811⟩

Article dans une revue hal-04901397v1

Reversal and Transposition Distance on Unbalanced Genomes Using Intergenic Information

Alexsandro Oliveira Alexandrino , Andre Rodrigues Oliveira , Géraldine Jean , Guillaume Fertin , Ulisses Dias et al.

Journal of Computational Biology, 2023, 30 (8), pp.861-876. ⟨10.1089/cmb.2023.0087⟩

Article dans une revue hal-04416210v1

Approximation algorithms for sorting by k-cuts on signed permutations

Andre Rodrigues Oliveira , Alexsandro Oliveira Alexandrino , Géraldine Jean , Guillaume Fertin , Ulisses Dias et al.

Journal of Combinatorial Optimization, 2022, 45 (6), ⟨10.1007/s10878-022-00937-z⟩

Article dans une revue hal-04416193v1

Sorting Permutations by Intergenic Operations

Andre Rodrigues Oliveira , Geraldine Jean , Guillaume Fertin , Klairton Lima Brito , Ulisses Dias et al.

IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2021, pp.1-1. ⟨10.1109/TCBB.2021.3077418⟩

Article dans une revue hal-03346838v1
Deposit thumbnail

The Maximum Colorful Arborescence problem: How (computationally) hard can it be?

Guillaume Fertin , Julien Fradin , Géraldine Jean

Theoretical Computer Science, 2021, 852, pp.104-120. ⟨10.1016/j.tcs.2020.11.021⟩

Article dans une revue hal-03346859v1
Deposit thumbnail

Sorting by Multi-Cut Rearrangements

Laurent Bulteau , Guillaume Fertin , Géraldine Jean , Christian Komusiewicz

Algorithms, 2021, 14 (6), pp.169. ⟨10.3390/a14060169⟩

Article dans une revue hal-03388451v1
Deposit thumbnail

Decomposing Subcubic Graphs into Claws, Paths or Triangles

Laurent Bulteau , Guillaume Fertin , Anthony Labarre , Romeo Rizzi , Irena Rusu

Journal of Graph Theory, 2021, 98 (4), pp.557-588. ⟨10.1002/jgt.22713⟩

Article dans une revue hal-03388424v1

Graph Motif Problems Parameterized by Dual

Guillaume Fertin , Christian Komusiewicz

Journal of Graph Algorithms and Applications, 2020, 24 (3), pp.371-396. ⟨10.7155/jgaa.00538⟩

Article dans une revue hal-02901620v1

Sorting Signed Permutations by Intergenic Reversals

Andre Rodrigues Oliveira , Géraldine Jean , Guillaume Fertin , Klairton Lima Brito , Laurent Bulteau et al.

IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2020, ⟨10.1109/TCBB.2020.2993002⟩

Article dans une revue hal-02901617v1

Sorting by Genome Rearrangements on Both Gene Order and Intergenic Sizes

Klairton Lima Brito , Géraldine Jean , Guillaume Fertin , Andre Rodrigues Oliveira , Ulisses Dias et al.

Journal of Computational Biology, 2020, 27 (2), pp.156-174. ⟨10.1089/cmb.2019.0293⟩

Article dans une revue hal-02482109v1
Deposit thumbnail

Super short operations on both gene order and intergenic sizes

Andre Oliveira , Géraldine Jean , Guillaume Fertin , Ulisses Dias , Zanoni Dias

Algorithms for Molecular Biology, 2019, 14 (1), ⟨10.1186/s13015-019-0156-5⟩

Article dans une revue hal-02481196v1

Prefix and suffix reversals on strings

Guillaume Fertin , Loïc Jankowiak , Géraldine Jean

Discrete Applied Mathematics, 2018, 246, pp.140 - 153. ⟨10.1016/j.dam.2017.07.031⟩

Article dans une revue hal-01911089v1

Optimal odd gossiping

Guillaume Fertin , Joseph Peters

Discrete Applied Mathematics, 2018, 247, pp.53 - 69. ⟨10.1016/j.dam.2018.03.033⟩

Article dans une revue hal-01911088v1

Matching algorithms for assigning orthologs after genome duplication events

Guillaume Fertin , Falk Hüffner , Christian Komusiewicz , Manuel Sorge

Computational Biology and Chemistry, 2018, 74, pp.379 - 390. ⟨10.1016/j.compbiolchem.2018.03.015⟩

Article dans une revue istex hal-01911090v1

Sorting permutations and binary strings by length-weighted rearrangements

Guillaume Fertin , Carla Negri Lintzmayer , Zanoni Dias

Theoretical Computer Science, 2018, 715, pp.35 - 59. ⟨10.1016/j.tcs.2018.01.012⟩

Article dans une revue hal-01705181v1

The S-labeling problem: An algorithmic tour

Guillaume Fertin , Irena Rusu , Stéphane Vialette

Discrete Applied Mathematics, 2018, 246, pp.49-61. ⟨10.1016/j.dam.2017.07.036⟩

Article dans une revue hal-01710032v1
Deposit thumbnail

Sorting signed circular permutations by super short operations

Andre Oliveira , Guillaume Fertin , Ulisses Dias , Zanoni Dias

Algorithms for Molecular Biology, 2018, 13 (1), ⟨10.1186/s13015-018-0131-6⟩

Article dans une revue hal-01911093v1

Odd Gossiping

Guillaume Fertin , Joseph G. Peters , Lynette Raabe , Charlie Xu

Discrete Applied Mathematics, 2017, 216, pp.550-561. ⟨10.1016/j.dam.2016.01.034⟩

Article dans une revue istex hal-01314648v1

Sorting permutations by prefix and suffix rearrangements

Carla Negri Lintzmayer , Guillaume Fertin , Zanoni Dias

Journal of Bioinformatics and Computational Biology, 2017, 15 (1), pp.1-46. ⟨10.1142/S0219720017500020⟩

Article dans une revue hal-01524046v1
Deposit thumbnail

Algorithms for computing the double cut and join distance on both gene order and intergenic sizes

Guillaume Fertin , Géraldine Jean , Eric Tannier

Algorithms for Molecular Biology, 2017, 12, 16 (11 p.). ⟨10.1186/s13015-017-0107-y⟩

Article dans une revue hal-01533200v1

SpecOMS: A Full Open Modification Search Method Performing All-to-All Spectra Comparisons within Minutes

Matthieu David , Guillaume Fertin , Hélène Rogniaux , Dominique Tessier

Journal of Proteome Research, 2017, 16 (8), pp.3030-3038. ⟨10.1021/acs.jproteome.7b00308⟩

Article dans une revue hal-01607343v1
Deposit thumbnail

Genome rearrangements with indels in intergenes restrict the scenario space

Laurent Bulteau , Guillaume Fertin , Eric Tannier

BMC Bioinformatics, 2016, 17 (Suppl 14), 426 (7 p.). ⟨10.1186/s12859-016-1264-6⟩

Article dans une revue hal-01396842v1

(Prefix) reversal distance for (signed) strings with few blocks or small alphabets

Laurent Bulteau , Guillaume Fertin , Christian Komusiewicz

Journal of Discrete Algorithms, 2016, 37, pp.44-55. ⟨10.1016/j.jda.2016.05.002⟩

Article dans une revue hal-01318663v1
Deposit thumbnail

Towards an Algorithmic Guide to Spiral Galaxies

Guillaume Fertin , Shahrad Jamshidi , Christian Komusiewicz

Theoretical Computer Science, 2015, pp.26-39. ⟨10.1016/j.tcs.2015.01.051⟩

Article dans une revue hal-01159940v1
Deposit thumbnail

Some algorithmic results for [2]-sumset covers

Laurent Bulteau , Guillaume Fertin , Stéphane Vialette , Roméo Rizzi

Information Processing Letters, 2015, 115 (1), pp.1-5

Article dans une revue hal-01044891v1
Deposit thumbnail

Finding Supported Paths in Heterogeneous Networks

Guillaume Fertin , Christian Komusiewicz , Hafedh Mohamed-Babou , Irena Rusu

Algorithms, 2015, ⟨10.3390/a8040810⟩

Article dans une revue hal-01214037v1

Approximation algorithms for sorting by length-weighted prefix and suffix operations

Carla Negri Lintzmayer , Zanoni Dias , Guillaume Fertin

Theoretical Computer Science, 2015, 593, pp.26-41. ⟨10.1016/j.tcs.2015.05.039⟩

Article dans une revue hal-01164599v1
Deposit thumbnail

Path-Driven Orientation of Mixed Graphs

Guillaume Fertin , Hafedh Mohamed-Babou , Irena Rusu

Discrete Applied Mathematics, 2015, 181, pp.98-108. ⟨10.1016/j.dam.2014.10.016⟩

Article dans une revue hal-01044921v1
Deposit thumbnail

Hybrid de novo tandem repeat detection using short and long reads

Guillaume Fertin , Géraldine Jean , Andreea Radulescu , Irena Rusu

BMC Medical Genomics, 2015, 8 (Suppl 3), pp.S5. ⟨10.1186/1755-8794-8-S3-S5⟩

Article dans une revue hal-01214038v1
Deposit thumbnail

Pancake Flipping Is Hard

Laurent Bulteau , Guillaume Fertin , Irena Rusu

Journal of Computer and System Sciences, 2015, 81 (8), pp.1556-1574. ⟨10.1016/j.jcss.2015.02.003⟩

Article dans une revue hal-01053461v1

Finding Approximate and Constrained Motifs in Graphs

Riccardo Dondi , Guillaume Fertin , Stéphane Vialette

Theoretical Computer Science, 2013, 483 (-), pp.10-21. ⟨10.1016/j.tcs.2012.08.023⟩

Article dans une revue istex hal-00726556v1
Deposit thumbnail

Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms

Laurent Bulteau , Guillaume Fertin , Irena Rusu

Journal of Discrete Algorithms, 2013, 19, pp.1-22

Article dans une revue hal-00826876v1
Deposit thumbnail

Revisiting the Minimum Breakpoint Linearization Problem Theoretical Computer Science

Laurent Bulteau , Guillaume Fertin , Irena Rusu

Theoretical Computer Science, 2013, 494, pp.122-133

Article dans une revue hal-00826880v1
Deposit thumbnail

Sorting by Transpositions is Difficult

Laurent Bulteau , Guillaume Fertin , Irena Rusu

SIAM Journal on Discrete Mathematics, 2012, 26 (3), pp.1148-1180. ⟨10.1137/110851390⟩

Article dans une revue hal-00826867v1
Deposit thumbnail

Tractability and approximability of maximal strip recovery

Laurent Bulteau , Guillaume Fertin , Minghui Jiang , Irena Rusu

Theoretical Computer Science, 2012, 440-441, pp.14-28. ⟨10.1016/j.tcs.2012.04.034⟩

Article dans une revue hal-00700598v1
Deposit thumbnail

Complexity issues in Vertex-Colored Graph Pattern Matching

Riccardo Dondi , Guillaume Fertin , Stéphane Vialette

Journal of Discrete Algorithms, 2011, 9 (1), pp.82-99. ⟨10.1016/j.jda.2010.09.002⟩

Article dans une revue hal-00606154v1
Deposit thumbnail

Upper and lower bounds for finding connected motifs in vertex-colored graphs

Michael R. Fellows , Guillaume Fertin , Danny Hermelin , Stéphane Vialette

Journal of Computer and System Sciences, 2011, 77 (4), pp.799-811. ⟨10.1016/j.jcss.2010.07.003⟩

Article dans une revue hal-00606148v1
Deposit thumbnail

Finding Common Structured Patterns in Linear Graphs

Guillaume Fertin , Danny Hermelin , Romeo Rizzi , Stéphane Vialette

Theoretical Computer Science, 2010, 411 (26-28), pp.2475-2486. ⟨10.1016/j.tcs.2010.02.017⟩

Article dans une revue hal-00482850v1
Deposit thumbnail

Finding Occurrences of Protein Complexes in Protein-Protein Interaction Graphs

Guillaume Fertin , Romeo Rizzi , Stéphane Vialette

Journal of Discrete Algorithms, 2009, 7 (1), pp.90-101

Article dans une revue hal-00416394v1
Deposit thumbnail

On the Approximability of Comparing Genomes with Duplicates

Sébastien Angibaud , Guillaume Fertin , Irena Rusu , Annelyse Thévenin , Stéphane Vialette

Journal of Graph Algorithms and Applications, 2009, 13 (1), pp.19-53

Article dans une revue hal-00416440v1
Deposit thumbnail

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 Thevenin , Stéphane Vialette

Journal of Computational Biology, 2008, 15 (8), pp.1093-1115. ⟨10.1089/cmb.2008.0061⟩

Article dans une revue hal-00416446v1
Deposit thumbnail

Fixed-Parameter Algorithms For Protein Similarity Search Under mRNA Structure Constraints

Guillaume Blin , Guillaume Fertin , Danny Hermelin , Stéphane Vialette

Journal of Discrete Algorithms, 2008, 6 (4), pp.618-626

Article dans une revue hal-00416442v1
Deposit thumbnail

Vertex labeling and routing in expanded Apollonian networks

Zhongzhi Zhang , Francesc Comellas , Guillaume Fertin , André Raspaud , Lili Rong et al.

Journal of Physics A: Mathematical and Theoretical, 2008, 41 (3), pp.035004

Article dans une revue hal-00416574v1
Deposit thumbnail

Acyclic Coloring of Graphs of Maximum Degree Five: Nine Colors are Enough

Guillaume Fertin , André Raspaud

Information Processing Letters, 2008, 105 (2), pp.65-72

Article dans une revue hal-00416567v1
Deposit thumbnail

Comparing Genomes with Duplications: a Computational Complexity Point of View

Guillaume Blin , Cedric Chauve , Guillaume Fertin , Romeo Rizzi , Stéphane Vialette

ACM Transactions on Computational Logic, 2007, 4 (4), pp.523-534. ⟨10.1109/TCBB.2007.1069⟩

Article dans une revue hal-00417720v1
Deposit thumbnail

L(p,q) labeling of d-Dimensional Grids

Guillaume Fertin , André Raspaud

Discrete Mathematics, 2007, 307 (16), pp.2132-2140

Article dans une revue hal-00307791v1

L(p,q) labeling of d-dimensional grids

Guillaume Fertin , André Raspaud

Discrete Mathematics, 2007, 307 (16), pp.2132-2140

Article dans une revue hal-00293512v1
Deposit thumbnail

Extracting Constrained 2-Interval Subsets in 2-Interval Sets

Guillaume Blin , Guillaume Fertin , Stéphane Vialette

Theoretical Computer Science, 2007, 385 (1-3), pp.241-263

Article dans une revue hal-00417717v1
Deposit thumbnail

A General Framework for Computing Rearrangement Distances between Genomes with Duplicates

Sébastien Angibaud , Guillaume Fertin , Irena Rusu , Stéphane Vialette

Journal of Computational Biology, 2007, 14 (4), pp.379-393. ⟨10.1089/cmb.2007.A001⟩

Article dans une revue hal-00417735v1
Deposit thumbnail

Exemplar Longest Common Subsequence

Paola Bonizzoni , Gianluca Della Vedova , Riccardo Dondi , Guillaume Fertin , Rafaella Rizzi et al.

ACM Transactions on Computational Logic, 2007, 4 (4), pp.535-543

Article dans une revue hal-00417728v1
Deposit thumbnail

New Bounds for the L(h,k) Number of Regular Grids

Tiziana Calamoneri , Saverio Caminiti , Guillaume Fertin

International Journal of Mobile Network Design and Innovation, 2006, 1 (2), pp.92-101

Article dans une revue hal-00461775v1
Deposit thumbnail

High dimensional Apollonian networks

Zhongzhi Zhang , Francesc Comellas , Guillaume Fertin , Lili Rong

Journal of Physics A: Mathematical and Theoretical, 2006, 39, pp.1811-1818

Article dans une revue hal-00461776v1
Deposit thumbnail

What makes the Arc-Preserving Subsequence problem hard ?

Guillaume Blin , Guillaume Fertin , Romeo Rizzi , Stéphane Vialette

LNCS Transactions on Computational Systems Biology, 2005, 2, pp.1-36

Article dans une revue hal-00417738v1
Deposit thumbnail

Star Coloring of Graphs

Guillaume Fertin , André Raspaud , Bruce Reed

Journal of Graph Theory, 2004, 47 (3), pp.163-182

Article dans une revue hal-00307788v1
Deposit thumbnail

On Maximal Instances for the Original Syntenic Distance

Cedric Chauve , Guillaume Fertin

Theoretical Computer Science, 2004, 326, pp.29-43

Article dans une revue hal-00417741v1
Deposit thumbnail

A Survey of Knödel Graphs

Guillaume Fertin , André Raspaud

Discrete Applied Mathematics, 2004, 137 (2), pp.173-195

Article dans une revue hal-00307786v1

A Survey on Knödel Graphs

Guillaume Fertin , André Raspaud

Discrete Applied Mathematics, 2003, 137 (2), pp.173--195

Article dans une revue hal-00442434v1

Factor d-Domatic Colorings of Graphs

Noga Alon , Guillaume Fertin , Arthur L. Liestman , Thomas C. Shermer , Ladislav Stacho

Discrete Mathematics, 2003, 262 (1--3), pp.17--25

Article dans une revue hal-00442418v1
Deposit thumbnail

Acyclic and k-distance coloring of the grid

G. Fertin , Emmanuel Godard , André Raspaud

Information Processing Letters, 2003, 87 (1), pp.51-58

Article dans une revue hal-00307787v1
Deposit thumbnail

On the oriented chromatic number of grids

Guillaume Fertin , André Raspaud , Arup Roychowdhury

Information Processing Letters, 2003, 85 (5), pp.261-266

Article dans une revue hal-00307790v1
Deposit thumbnail

Minimum feedback vertex set and acyclic coloring

Guillaume Fertin , Emmanuel Godard , André Raspaud

Information Processing Letters, 2002, 84 (3), pp.131-139

Article dans une revue hal-00307785v1

Routing permutations and 2-1 routing requests in the hypercube

Olivier Baudon , Guillaume Fertin , Ivan Havel

Discrete Applied Mathematics, 2001, 113, pp.43-58

Article dans une revue hal-00649005v1

On the Structure of Minimum Broadcast Digraphs

Guillaume Fertin

Theoretical Computer Science, 2000, 245 (2), pp.203--216

Article dans une revue hal-00442425v1

Compounding of Gossip Graphs

Guillaume Fertin , Roger Labahn

Networks, 2000, 36 (2), pp.126--137

Article dans une revue hal-00442427v1

A Study of Minimum Gossip Graphs

Guillaume Fertin

Discrete Mathematics, 2000, 215 (1--3), pp.33--57

Article dans une revue hal-00442424v1
Deposit thumbnail

Best of Both Worlds: Solving the Cyclic Bandwidth Problem by Combining Pre-existing Knowledge and Constraint Programming Techniques

Guillaume Fertin , Eric Monfroy , Claudia Vasconcellos-Gaete

International Conference on Computational Science - ICCS 24, Jul 2024, Hanoi, Vietnam. pp.197-211, ⟨10.1007/978-3-031-63775-9_14⟩

Communication dans un congrès hal-04646116v1

Approximating Rearrangement Distances with Replicas and Flexible Intergenic Regions

Gabriel Siqueira , Alexsandro Oliveira Alexandrino , Andre Rodrigues Oliveira , Géraldine Jean , Guillaume Fertin et al.

International Symposium on Bioinformatics Research and Applications (ISBRA 2023), Oct 2023, Wrocław, Poland. pp.241-254, ⟨10.1007/978-981-99-7074-2_19⟩

Communication dans un congrès hal-04418179v1

The Exact Subset MultiCover Problem

Emile Benoist , Guillaume Fertin , Géraldine Jean

Theory and Applications of Models of Computation. TAMC 2022, Sep 2022, Tianjin, China. pp.189-200, ⟨10.1007/978-3-031-20350-3_16⟩

Communication dans un congrès hal-03958441v1

Transposition Distance Considering Intergenic Regions for Unbalanced Genomes

Alexsandro Oliveira Alexandrino , Andre Rodrigues Oliveira , Géraldine Jean , Guillaume Fertin , Ulisses Dias et al.

Bioinformatics Research and Applications 18th International Symposium, ISBRA 2022, Nov 2022, Haifa, Israel. pp.100-113, ⟨10.1007/978-3-031-23198-8_10⟩

Communication dans un congrès hal-03958480v1
Deposit thumbnail

The Maximum Zero-Sum Partition Problem

Guillaume Fertin , Oscar Fontaine , Géraldine Jean , Stéphane Vialette

25th International Computer Symposium, ICS 2022, Dec 2022, Taoyuan, Taiwan. pp.73-85, ⟨10.1007/978-981-19-9582-8_7⟩

Communication dans un congrès hal-04293802v1

Sorting Genomes by Prefix Double-Cut-and-Joins

Guillaume Fertin , Géraldine Jean , Anthony Labarre

String Processing and Information Retrieval, 29th International Symposium, SPIRE 2022, Nov 2022, Concepcion, Chile. pp.178-190, ⟨10.1007/978-3-031-20643-6_13⟩

Communication dans un congrès hal-03958465v1
Deposit thumbnail

Permutation Pattern Matching for Doubly Partially Ordered Patterns

Laurent Bulteau , Guillaume Fertin , Vincent Jugé , Stéphane Vialette

33rd Annual Symposium on Combinatorial Pattern Matching, Hideo Bannai and Jan Holub, Jun 2022, Prague, Czech Republic. ⟨10.4230/lipics.cpm.2022.21⟩

Communication dans un congrès hal-03624311v1
Deposit thumbnail

L'Inférence de Protéines à travers le Modèle Peptide Quantity Assignment

Emile Benoist , Guillaume Fertin , Géraldine Jean

23ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, INSA Lyon, Feb 2022, Villeurbanne - Lyon, France

Communication dans un congrès hal-03595308v1

Sorting by k-Cuts on Signed Permutations

Andre Rodrigues Oliveira , Alexsandro Oliveira Alexandrino , Géraldine Jean , Guillaume Fertin , Ulisses Dias et al.

Comparative Genomics 19th International Conference, RECOMB-CG 2022, May 2022, La Jolla, United States. pp.189-204, ⟨10.1007/978-3-031-06220-9_11⟩

Communication dans un congrès hal-03959780v1

Sorting by Multi-cut Rearrangements

Laurent Bulteau , Guillaume Fertin , Géraldine Jean , Christian Komusiewicz

SOFSEM 2021, Jan 2021, Bolzano-Bozen, Italy. pp.593-607, ⟨10.1007/978-3-030-67731-2_43⟩

Communication dans un congrès hal-03346830v1

A 3.5-Approximation Algorithm for Sorting by Intergenic Transpositions

Andre Rodrigues Oliveira , Géraldine Jean , Guillaume Fertin , Klairton Lima Brito , Ulisses Dias et al.

7th International Conference, AlCoB 2020 (Algorithms for Computational Biology ), Apr 2020, Missoula, United States. pp.16-28, ⟨10.1007/978-3-030-42266-0_2⟩

Communication dans un congrès hal-02528304v1
Deposit thumbnail

Finding a Small Number of Colourful Components

Laurent Bulteau , Konrad K. Dabrowski , Guillaume Fertin , Matthew Johnson , Daniël Paulusma et al.

CPM 2019, Jul 2019, Pise, Italy. ⟨10.4230/LIPIcs.CPM.2019.20⟩

Communication dans un congrès hal-02304030v1
Deposit thumbnail

Unshuffling Permutations

Guillaume Fertin , Samuele Giraudo , Sylvie Hamel , Stéphane Vialette

TAMC, Apr 2019, Kitakyushu, Japan. pp.242-261, ⟨10.1007/978-3-030-14812-6_15⟩

Communication dans un congrès hal-02304028v1

Sorting by Reversals, Transpositions, and Indels on Both Gene Order and Intergenic Sizes

Klairton Lima Brito , Géraldine Jean , Guillaume Fertin , Andre Rodrigues Oliveira , Ulisses Dias et al.

International Symposium on Bioinformatics Research and Applications ISBRA 2019, Jun 2019, Barcelona, Spain. pp.28-39, ⟨10.1007/978-3-030-20242-2_3⟩

Communication dans un congrès hal-02304027v1

Super Short Reversals on Both Gene Order and Intergenic Sizes

Andre Rodrigues Oliveira , Géraldine Jean , Guillaume Fertin , Ulisses Dias , Zanoni Dias

Advances in Bioinformatics and Computational Biology - 11th Brazilian Symposium on Bioinformatics -- BSB 2018, Oct 2018, Niteroi, Brazil. pp.14--25, ⟨10.1007/978-3-030-01722-4_2⟩

Communication dans un congrès hal-02081164v1

On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure

Guillaume Fertin , Julien Fradin , Christian Komusiewicz

Annual Symposium on Combinatorial Pattern Matching -- CPM 2018, Jul 2018, Qingdao, China

Communication dans un congrès hal-02081156v1

Algorithmic Aspects of the Maximum Colorful Arborescence Problem

Guillaume Fertin , Julien Fradin , Géraldine Jean

Theory and Applications of Models of Computation - 14th Annual Conference, Apr 2017, Berne, Switzerland. pp.216-230, ⟨10.1007/978-3-319-55911-7_16⟩

Communication dans un congrès hal-01524069v1
Deposit thumbnail

Beyond Adjacency Maximization: Scaffold Filling for New String Distances

Laurent Bulteau , Guillaume Fertin , Christian J Komusiewicz

28th Annual Symposium on Combinatorial Pattern Matching, 2017, Warsaw, Poland. ⟨10.4230/LIPIcs.CPM.2017.27⟩

Communication dans un congrès hal-01615671v1
Deposit thumbnail

Decomposing Cubic Graphs into Connected Subgraphs of Size Three

Laurent Bulteau , Guillaume Fertin , Anthony Labarre , Romeo Rizzi , Irena Rusu

The 22nd International Computing and Combinatorics Conference (COCOON), Aug 2016, Ho Chi Minh City, Vietnam. ⟨10.1007/978-3-319-42634-1_32⟩

Communication dans un congrès hal-01309152v1

Genome Rearrangements on both Gene Order and Intergenic Regions

Guillaume Fertin , Géraldine Jean , Eric Tannier

WABI 2016, 2016, Aarhus, Denmark. pp.162-173

Communication dans un congrès hal-01334942v1

Graph Motif Problems Parameterized by Dual

Guillaume Fertin , Christian Komusiewicz

27th Annual Symposium on Combinatorial Pattern Matching, Jun 2016, Tel-Aviv, France

Communication dans un congrès hal-01311579v1

SpecTrees: An efficient without a priori data structure for MS/MS spectra identification

Matthieu David , Guillaume Fertin , Dominique Tessier

16th International Workshop on Algorithms in Bioinformatics (WABI), Aug 2016, Aarhus, Denmark. 12 p., ⟨10.1007/978-3-319-43681-4_6⟩

Communication dans un congrès hal-01602410v1
Deposit thumbnail

Obtaining a Triangular Matrix by Independent Row-Column Permutations

Guillaume Fertin , Irena Rusu , Stéphane Vialette

26th 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

Prefix and Suffix Reversals on Strings

Guillaume Fertin , Loïc Jankowiak , Géraldine Jean

22nd International Symposiumon String Processing and Information Retrieval (SPIRE 2015), Sep 2015, London, United Kingdom. pp.1-12, ⟨10.1007/978-3-319-23826-5_17⟩

Communication dans un congrès hal-01194636v1

Algorithmic aspects of the S-Labeling problem

Guillaume Fertin , Irena Rusu , Stéphane Vialette

26th International Workshop on Combinatorial Algorithms (IWOCA 2015), Oct 2015, Verona, Italy. pp.173-184

Communication dans un congrès hal-01311584v1

DExTaR: Detection of Exact Tandem Repeats based on the de Bruijn graph

Guillaume Fertin , Géraldine Jean , Andreea Radulescu , Irena Rusu

IEEE International Conference on Bioinformatics and Biomedicine (BIBM 2014), Nov 2014, Belfast, Ireland. pp.90-93, ⟨10.1109/BIBM.2014.6999134⟩

Communication dans un congrès hal-01117967v1
Deposit thumbnail

Towards an Algorithmic Guide to Spiral Galaxies

Guillaume Fertin , Shahrad Jamshidi , Christian Komusiewicz

Seventh International Conference on FUN WITH ALGORITHMS (FUN 2014), Jul 2014, Lipari, Italy. pp.171-182, ⟨10.1007/978-3-319-07890-8_15⟩

Communication dans un congrès hal-01044934v1
Deposit thumbnail

Reversal Distances for Strings with Few Blocks or Small Alphabets

Laurent Bulteau , Guillaume Fertin , Christian Komusiewicz

25th Annual Symposium on Combinatorial Pattern Matching (CPM 2014), Jun 2014, Moscou, Russia. pp.50-59, ⟨10.1007/978-3-319-07566-2_6⟩

Communication dans un congrès hal-01044938v1

A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications

Laurent Bulteau , Guillaume Fertin , Christian Komusiewicz , Irena Rusu

13th Workshop on Algorithms in Bioinformatics (WABI2013), Sep 2013, Nice, France. pp.244-258, ⟨10.1007/978-3-642-40453-5_19⟩

Communication dans un congrès hal-00906903v1
Deposit thumbnail

Pancake Flipping is Hard

Laurent Bulteau , Guillaume Fertin , Irena Rusu

37th International Symposium on Mathematical Foundations of Computer Science (MFCS 2012), Aug 2012, Bratislava, Slovakia. pp.247-258

Communication dans un congrès hal-00717712v1
Deposit thumbnail

Algorithms for subnetwork mining in heterogeneous networks

Guillaume Fertin , Hafedh Mohamed-Babou , Irena Rusu

11th Symposium on Experimental Algorithms (SEA 2012), Jun 2012, Bordeaux, France. pp.184-194

Communication dans un congrès hal-00689889v1
Deposit thumbnail

On the Complexity of two Problems on Orientations of Mixed Graphs

Guillaume Fertin , Hafedh Mohamed-Babou , Irena Rusu

In Proc. 5èmes Journées Ouvertes Biologie Informatique Mathématiques (JOBIM 2012), Jul 2012, Rennes, France. pp.161-170

Communication dans un congrès hal-00826863v1
Deposit thumbnail

Tractability and Approximability of Maximal Strip Recovery

Laurent Bulteau , Guillaume Fertin , Minghui Jiang , Irena Rusu

22nd Annual Symposium on Combinatorial Pattern Matching (CPM 2011), 2011, Palermo, Italy. pp.336-349

Communication dans un congrès hal-00606167v1
Deposit thumbnail

Algorithmic Aspects of Heterogeneous Biological Networks Comparison

Guillaume Blin , Guillaume Fertin , Hafedh Mohamed-Babou , Irena Rusu , Florian Sikora et al.

COCOA 2011, 2011, Zhangjiajie, China. pp.272-286, ⟨10.1007/978-3-642-22616-8_22⟩

Communication dans un congrès hal-00606375v1
Deposit thumbnail

Finding Approximate and Constrained Motifs in Graphs

Riccardo Dondi , Guillaume Fertin , Stéphane Vialette

CPM 2011, 2011, Palermo, Italy. pp.388-401, ⟨10.1007/978-3-642-21458-5_33⟩

Communication dans un congrès hal-00606173v1
Deposit thumbnail

Integration of omics data to investigate common intervals

Sébastien Angibaud , Philippe Bordron , Damien Eveillard , Guillaume Fertin , Irena Rusu

1st International Conference on Bioscience, Biochemistry and Bioinformatics (ICBBB 2011), 2011, Singapore, Singapore. pp.101-105

Communication dans un congrès hal-00606226v1
Deposit thumbnail

Sorting by Transpositions is Difficult

Laurent Bulteau , Guillaume Fertin , Irena Rusu

38th International Colloquium on Automata, Languages and Programming (ICALP 2011), 2011, Zürich, Switzerland. pp.654-665

Communication dans un congrès hal-00606223v1
Deposit thumbnail

Revisiting the Minimum Breakpoint Linearization Problem

Laurent Bulteau , Guillaume Fertin , Irena Rusu

7th Annual Conference on Theory and Applications of Models of Computation (TAMC 2010), Jun 2010, Prague, France. pp.163-174

Communication dans un congrès hal-00482856v1
Deposit thumbnail

Proper Alignment of MS/MS Spectra from Unsequenced Species

Freddy Cliquet , Guillaume Fertin , Irena Rusu , Dominique Tessier

11th International Conference on Bioinformatics and Computational Biology (BIOCOMP 2010), Sep 2010, Las Vegas, United States. pp.766-772, ⟨10.1007/978-3-642-03223-3_3⟩

Communication dans un congrès hal-01068873v1
Deposit thumbnail

Maximum Motif Problem in Vertex-Colored Graphs

Riccardo Dondi , Guillaume Fertin , Stéphane Vialette

20th Annual Symposium on Combinatorial Pattern Matching (CPM 2009), 2009, Lille, France. pp.221-235, ⟨10.1007/978-3-642-02441-2_20⟩

Communication dans un congrès hal-00416463v1
Deposit thumbnail

Comparison of Spectra in Unsequenced Species

Freddy Cliquet , Guillaume Fertin , Irena Rusu , Dominique Tessier

4th Brazilian Symposium on Bioinformatics (BSB 2009), 2009, Porto Alegre, Brazil. pp.24-35, ⟨10.1007/978-3-642-03223-3_3⟩

Communication dans un congrès hal-00416462v1
Deposit thumbnail

Pseudo-Boolean Programming for Partially Ordered Genomes

Sébastien Angibaud , Guillaume Fertin , Annelyse Thevenin , Stéphane Vialette

RECOMB-CG 2009, Sep 2009, Budapest, Hungary. pp.126-137, ⟨10.1007/978-3-642-04744-2_11⟩

Communication dans un congrès hal-00416458v1
Deposit thumbnail

Comparing Bacterial Genomes by Searching their Common Intervals

Sébastien Angibaud , Damien Eveillard , Guillaume Fertin , Irena Rusu

1st International Conference on Bioinformatics and Computational Biology (BICoB 2009), 2009, New Orleans, United States. pp.102-113, ⟨10.1007/978-3-642-00727-9_12⟩

Communication dans un congrès istex hal-00416466v1
Deposit thumbnail

The Exemplar Breakpoint Distance for non-trivial genomes cannot be approximated

Guillaume Blin , Guillaume Fertin , Florian Sikora , Stéphane Vialette

WALCOM 2009, 2009, Kolkata, India. pp.357-368

Communication dans un congrès hal-00416491v1
Deposit thumbnail

Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms

Laurent Bulteau , Guillaume Fertin , Irena Rusu

ISAAC 2009 (20th International Symposium on Algorithms and Computation), 2009, Hawaii, United States. pp.710-719

Communication dans un congrès hal-00425145v1
Deposit thumbnail

On the S-labeling Problem

Guillaume Fertin , Stéphane Vialette

Proc. 5th Euroconference on Combinatorics, Graph Theory and Applications (EUROCOMB 2009), 2009, Bordeaux, France. pp.273-277

Communication dans un congrès hal-00416570v1
Deposit thumbnail

On Finding Small 2-Generating Sets

Isabelle Fagnot , Guillaume Fertin , Stéphane Vialette

COCOON 2009, 2009, Niagara Falls, United States. pp.378-387, ⟨10.1007/978-3-642-02882-3_38⟩

Communication dans un congrès hal-00416577v1
Deposit thumbnail

On the Approximability of Comparing Genomes with Duplicates

Sébastien Angibaud , Guillaume Fertin , Irena Rusu

2nd Workshop on Algorithms and Computation (WALCOM 2008), 2008, Dhaka, Bangladesh. pp.34-45

Communication dans un congrès hal-00416492v1
Deposit thumbnail

A Pseudo-Boolean programming approach for computing the breakpoint distance between two genomes with duplicate genes

Sébastien Angibaud , Guillaume Fertin , Irena Rusu , Annelyse Thevenin , Stéphane Vialette

5th RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG 2007), 2007, San Diego, United States. pp.16-29

Communication dans un congrès hal-00417902v1
Deposit thumbnail

Comparing RNA Structures: Towards an Intermediate Model Between the EDIT and the LAPCS Problems

Guillaume Blin , Guillaume Fertin , Gaël Herry , Stéphane Vialette

Brazilian Symposium on Bioinformatics (BSB 2007), Aug 2007, Angra dos Reis, Brazil. pp.101-112

Communication dans un congrès hal-00417918v1
Deposit thumbnail

Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs

Michael R. Fellows , Guillaume Fertin , Danny Hermelin , Stéphane Vialette

34th International Colloquium on Automata, Languages and Programming (ICALP 2007), 2007, Wroclaw, Poland. pp.340-351

Communication dans un congrès hal-00417928v1
Deposit thumbnail

Extending the Hardness of RNA Secondary Structure Comparison

Guillaume Blin , Guillaume Fertin , Irena Rusu , Christine Sinoquet

1st International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE 2007), Apr 2007, Hangzhou, China. pp.140-151

Communication dans un congrès hal-00418248v1
Deposit thumbnail

Common Structured Patterns in Linear Graphs: Approximations and Combinatorics

Guillaume Fertin , Danny Hermelin , Romeo Rizzi , Stéphane Vialette

18th Annual Symposium on Combinatorial Pattern Matching (CPM 2007), 2007, London, Canada. pp.214-252

Communication dans un congrès hal-00418241v1
Deposit thumbnail

Weak pattern matching in colored graphs: Minimizing the number of connected components

Riccardo Dondi , Guillaume Fertin , Stéphane Vialette

10th Italian Conference on Theoretical Computer Science (ICTCS 2007), 2007, Rome, Italy. pp.27-38

Communication dans un congrès hal-00417910v1
Deposit thumbnail

Genomes containing Duplicates are Hard to compare

Cedric Chauve , Guillaume Fertin , Romeo Rizzi , Stéphane Vialette

International Workshop on Bioinformatics Research and Applications (IWBRA 2006), 2006, Reading, United Kingdom. pp.783-790

Communication dans un congrès hal-00418260v1
Deposit thumbnail

How Pseudo-Boolean Programming can help Genome Rearrangement Distance Computation

Sébastien Angibaud , Guillaume Fertin , Irena Rusu , Stéphane Vialette

4th RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG 2006), 2007, Montréal, Canada. pp.75-86

Communication dans un congrès hal-00418258v1

Genomes containing duplicates are hard to compare

Cedric Chauve , Guillaume Fertin , Romeo Rizzi , Stéphane Vialette

Proc Int. Workshop on Bioinformatics Research and Applications (IWBRA), 2006, Reading, UK, United Kingdom. pp.783-790

Communication dans un congrès hal-00620297v1

How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation

Sébastien Angibaud , Guillaume Fertin , Irena Rusu , Stéphane Vialette

4thAnnual RECOMB Satellite Workshop on Comparative Genomics (RECOMB-CG'06), 2006, Montreal, Canada, Canada. pp.75-86

Communication dans un congrès hal-00619848v1

Exemplar Longest Common Subsequences

Paola Bonizzoni , Gianuca Della Vedova , Riccardo Dondi , Guillaume Fertin , Stéphane Vialette

Int. Workshop on Bioinformatics Research and Applications (IWBRA), 2006, United States. pp.622-629

Communication dans un congrès hal-00620296v1
Deposit thumbnail

Exemplar Longest Common Subsequence (extended abstract)

Paola Bonizzoni , Gianluca Della Vedova , Riccardo Dondi , Guillaume Fertin , Stéphane Vialette

International Workshop on Bioinformatics Research and Applications (IWBRA 2006), May 2006, Reading, United Kingdom. pp.622-629

Communication dans un congrès hal-00461780v1

Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs

Guillaume Fertin , Romeo Rizzi , Stéphane Vialette

30th International Symposium on Mathematical Foundations of Computer Science (MFCS'05), 2005, Gdansk, Poland, Poland. pp.328-339

Communication dans un congrès hal-00620292v1
Deposit thumbnail

Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints

Guillaume Blin , Guillaume Fertin , Danny Hermelin , Stéphane Vialette

31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG'05), Jun 2005, Metz, France. pp.271-282

Communication dans un congrès hal-00620363v1
Deposit thumbnail

Genes Order and Phylogenetic Reconstruction: Application to $\gamma$-Proteobacteria

Guillaume Blin , Cedric Chauve , Guillaume Fertin

3rd Annual RECOMB Satellite Workshop on Comparative Genomics (RECOMB-CG'05), Sep 2005, Dublin, Ireland, Ireland. pp.11-20

Communication dans un congrès hal-00620362v1
Deposit thumbnail

What Makes the Arc-Preserving Subsequence Problem Hard?

Guillaume Blin , Guillaume Fertin , Romeo Rizzi , Stéphane Vialette

5th Int. Workshop on Bioinformatics Research and Applications (IWBRA'05), May 2005, Atlanta, GA, USA, United States. pp.860-868

Communication dans un congrès hal-00620359v1
Deposit thumbnail

Acyclic Coloring of Graphs of Maximum Degree $\Delta$

Guillaume Fertin , André Raspaud

2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.389-396, ⟨10.46298/dmtcs.3450⟩

Communication dans un congrès hal-01184439v1

Pattern Matching in Arc-Annotated Sequences: New Results for the APS Problem

Guillaume Blin , Guillaume Fertin , Roméo Rizzi , Stéphane Vialette

5th Journées Ouvertes de Biologie, Informatique et Mathématiques (JOBIM'04), 2004, Montréal, Quebec, Canada. 12 pp

Communication dans un congrès hal-00620330v1
Deposit thumbnail

The breakpoint distance for signed sequences

Guillaume Blin , Guillaume Fertin , Cedric Chauve

1st Conference on Algorithms and Computational Methods for biochemical and Evolutionary Networks (CompBioNets'04), Dec 2004, Recife, Brazil, Brazil. pp.3-16

Communication dans un congrès hal-00620356v1
Deposit thumbnail

New Results for the 2-Interval Pattern Problem

Guillaume Blin , Guillaume Fertin , Stéphane Vialette

15th Symposium on Combinatorial Pattern Matching (CPM'04), Jul 2004, Istanbul, Turkey. pp.311-322

Communication dans un congrès hal-00620366v1
Deposit thumbnail

No-Hole L(p,0)-Labelling of Cycles, Grids and Hypercubes

Guillaume Fertin , André Raspaud , Ondrej Sykora

11th International Colloquium on Structural Information & Communication Complexity (SIROCCO 2004), Jun 2004, Smolenice, Slovakia. pp.138-148

Communication dans un congrès hal-00307789v1

Routing permutations in the hypercube

Olivier Baudon , Guillaume Fertin , Ivan Havel

International Workshop on Graph-Theoretic Concepts in Computer Science WG'99, Jun 1999, Ascona, Switzerland. pp.179-190

Communication dans un congrès hal-00649015v1

Improved Lower Bounds for the Cyclic Bandwidth Problem

Hugues Déprés , Guillaume Fertin , Eric Monfroy

International Conference on Computational Science (ICCS 2021), pp.555-569, 2021, ⟨10.1007/978-3-030-77961-0_45⟩

Chapitre d'ouvrage hal-03346828v1
Deposit thumbnail

Computing Genomic Distances: An Algorihtmic Viewpoint

Guillaume Fertin , Irena Rusu

Wiley Science. Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications, Wiley Science, pp.773-798, 2011, ⟨10.1002/9780470892107.ch34⟩

Chapitre d'ouvrage hal-00606146v1

Mass Spectra Interpretation and the Interest of SpecFit for Identifying Uncommon Modifications

Guillaume Fertin , Matthieu David , Hélène Rogniaux , Dominique Tessier

16th International Meeting, CIBB 2019, Bergamo, Italy, September 4–6, 2019, 12313, Springer International Publishing, pp.80-89, 2020, Lecture Notes in Computer Science, 978-3-030-63060-7. ⟨10.1007/978-3-030-63061-4_8⟩

Proceedings/Recueil des communications hal-04665835v1

Editorial

Riccardo Dondi , Guillaume Fertin , Giancarlo Mauri

Theoretical Computer Science, 717, Elsevier, 2018, Theoretical Computer Science, ⟨10.1016/j.tcs.2018.02.016⟩

Proceedings/Recueil des communications hal-01911085v1