Guillaume Fertin

Guillaume Fertin

Université de Nantes

H-index: 31

Europe-France

About Guillaume Fertin

Guillaume Fertin, With an exceptional h-index of 31 and a recent h-index of 15 (since 2020), a distinguished researcher at Université de Nantes, specializes in the field of Algorithms, Computational Complexity, Bioinformatics.

His recent articles reflect a diverse array of research interests and contributions to the field:

Fast alignment of mass spectra in large proteomics datasets, capturing dissimilarities arising from multiple complex modifications of peptides

Approximating Rearrangement Distances with Replicas and Flexible Intergenic Regions

Reversal and Transposition Distance on Unbalanced Genomes Using Intergenic Information

Approximation algorithms for sorting by k-cuts on signed permutations

The Maximum Zero-Sum Partition Problem

SpecGlob: rapid and accurate alignment of mass spectra differing from their peptide models by several unknown modifications

Transposition distance considering intergenic regions for unbalanced genomes

Sorting by k-Cuts on Signed Permutations

Guillaume Fertin Information

University

Position

LS2N France

Citations(all)

3210

Citations(since 2020)

874

Cited By

2877

hIndex(all)

31

hIndex(since 2020)

15

i10Index(all)

58

i10Index(since 2020)

20

Email

University Profile Page

Université de Nantes

Google Scholar

View Google Scholar Profile

Guillaume Fertin Skills & Research Interests

Algorithms

Computational Complexity

Bioinformatics

Top articles of Guillaume Fertin

Title

Journal

Author(s)

Publication Date

Fast alignment of mass spectra in large proteomics datasets, capturing dissimilarities arising from multiple complex modifications of peptides

BMC bioinformatics

Grégoire Prunier

Mehdi Cherkaoui

Albane Lysiak

Olivier Langella

Mélisande Blein-Nicolas

...

2023/11/8

Approximating Rearrangement Distances with Replicas and Flexible Intergenic Regions

Gabriel Siqueira

Alexsandro Oliveira Alexandrino

Andre Rodrigues Oliveira

Géraldine Jean

Guillaume Fertin

...

2023/10/8

Reversal and Transposition Distance on Unbalanced Genomes Using Intergenic Information

Journal of Computational Biology

Alexsandro Oliveira Alexandrino

Andre Rodrigues Oliveira

Géraldine Jean

Guillaume Fertin

Ulisses Dias

...

2023/8/1

Approximation algorithms for sorting by k-cuts on signed permutations

Journal of Combinatorial Optimization

Andre Rodrigues Oliveira

Alexsandro Oliveira Alexandrino

Géraldine Jean

Guillaume Fertin

Ulisses Dias

...

2023/1

The Maximum Zero-Sum Partition Problem

Guillaume Fertin

Oscar Fontaine

Géraldine Jean

Stéphane Vialette

2022/12/15

SpecGlob: rapid and accurate alignment of mass spectra differing from their peptide models by several unknown modifications

bioRxiv

Albane Lysiak

Guillaume Fertin

Géraldine Jean

Dominique Tessier

2022/5/31

Transposition distance considering intergenic regions for unbalanced genomes

Alexsandro Oliveira Alexandrino

Andre Rodrigues Oliveira

Géraldine Jean

Guillaume Fertin

Ulisses Dias

...

2022/11/14

Sorting by k-Cuts on Signed Permutations

Andre Rodrigues Oliveira

Alexsandro Oliveira Alexandrino

Géraldine Jean

Guillaume Fertin

Ulisses Dias

...

2022/5/15

Sorting genomes by prefix double-cut-and-joins

Guillaume Fertin

Géraldine Jean

Anthony Labarre

2022/11/1

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

Emile Benoist

Guillaume Fertin

Géraldine Jean

2022/2/23

The Exact Subset MultiCover Problem

Emile Benoist

Guillaume Fertin

Géraldine Jean

2022/9/16

MAGNETO: an automated workflow for genome-resolved metagenomics

mSystems

Samuel Chaffron Benjamin Churcheward

Maxime Millet

Audrey Bihouée

Guillaume Fertin

2022/6/15

Permutation pattern matching for doubly partially ordered patterns

Laurent Bulteau

Guillaume Fertin

Vincent Jugé

Stéphane Vialette

2022/6/27

Detection of multiple modifications in mass spectra without any a priori

Albane Lysiak

Guillaume Fertin

Géraldine Jean

Dominique Tessier

2021/10/31

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

Theoretical Computer Science

Guillaume Fertin

Julien Fradin

Géraldine Jean

2021/1/8

Improved Lower Bounds for the Cyclic Bandwidth Problem

Hugues Déprés

Guillaume Fertin

Eric Monfroy

2021/6/9

Sorting by multi-cut rearrangements

Algorithms

Christian Komusiewicz

2021

Interpreting Mass Spectra Differing from Their Peptide Models by Several Modifications

Albane Lysiak

Guillaume Fertin

Géraldine Jean

Dominique Tessier

2021/12/8

Sorting permutations by intergenic operations

IEEE/ACM Transactions on Computational Biology and Bioinformatics

Andre Rodrigues Oliveira

Geraldine Jean

Guillaume Fertin

Klairton Lima Brito

Ulisses Dias

...

2021/5/4

Decomposing subcubic graphs into claws, paths or triangles

Journal of Graph Theory

Laurent Bulteau

Guillaume Fertin

Anthony Labarre

Romeo Rizzi

Irena Rusu

2021/12

See List of Professors in Guillaume Fertin University(Université de Nantes)

Co-Authors

H-index: 65
Michael Fellows

Michael Fellows

Universitetet i Bergen

H-index: 57
Bruce Reed

Bruce Reed

McGill University

H-index: 43
Zhongzhi Zhang (章忠志)

Zhongzhi Zhang (章忠志)

Fudan University

H-index: 36
André Raspaud

André Raspaud

Université de Bordeaux

H-index: 34
Cedric Chauve

Cedric Chauve

Simon Fraser University

H-index: 32
Francesc Comellas

Francesc Comellas

Universidad Politécnica de Cataluña

academic-engine