Jean-François Gibrat

Jean-François Gibrat

Auto-generated profile, based on publicly available information

Jean-François Gibrat

MaIAGE, INRA, Université Paris-Saclay, Jouy-en-Josas 78350, France

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 February 2018 in F1000Research
Verified
Journal Article
Open access
PDF file
VAVictoria Dominguez Del Angel
Victoria Dominguez Del Angel
EHErik Hjerde
Erik Hjerde
LSLieven Sterck
Lieven Sterck
SCSalvador Capella-Gutiérrez
Salvador Capella-Gutiérrez
CNCedric Notredame
Cedric Notredame
HLHenrik Lantz
Henrik Lantz
As a part of the ELIXIR-EXCELERATE efforts in capacity building, we present here 10 steps to facilitate researchers getting started in genome assembly and genome annotation. The guidelines given are broadly applicable, intended to be stable over time, and cover all aspects from start to finish of a general assembly and annotation project. Intrinsic properties of genomes are discussed, as is the importance of using high quality DNA. Different sequencing technologies and generally applicable workflows for genome assembly are also detailed. We cover structural and functional annotation and encourage readers to also annotate transposable elements, something that is often omitted from annotation workflows. The importance of data management is stressed, and we give advice on where to submit data and how to make your results Findable, Accessible, Interoperable, and Reusable (FAIR).

12 June 2012 in Protein Engineering, Design and Selection
Verified
Journal Article
Open access
PDF file
GLGuillaume Launay
Guillaume Launay
Stéphane TéletchéaStéphane Téletchéa
Stéphane Téletchéa
FWFallou Wade
Fallou Wade
EPEdith Pajot-Augy
Edith Pajot-Augy
JGJean-François Gibrat
Jean-François Gibrat
GSGuenhaël Sanz
Guenhaël Sanz
We present a procedure that (i) automates the homology modeling of mammalian olfactory receptors (ORs) based on the six three-dimensional (3D) structures of G protein-coupled receptors (GPCRs) available so far and (ii) performs the docking of odorants on these models, using the concept of colony energy to score the complexes. ORs exhibit low-sequence similarities with other GPCR and current alignment methods often fail to provide a reliable alignment. Here, we use a fold recognition technique to obtain a robust initial alignment. We then apply our procedure to a human OR that we have previously functionally characterized. The analysis of the resulting in silico complexes, supported by receptor mutagenesis and functional assays in a heterologous expression system, suggests that antagonists dock in the upper part of the binding pocket whereas agonists dock in the narrow lower part. We propose that the potency of agonists in activating receptors depends on their ability to establish tight interactions with the floor of the binding pocket. We developed a web site that allows the user to upload a GPCR sequence, choose a ligand in a library and obtain the 3D structure of the free receptor and ligand–receptor complex (http://genome.jouy.inra.fr/GPCRautomodel).

15 June 2018 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
JGJean-François Gibrat
Jean-François Gibrat
Third generation sequencing technologies generate long reads that exhibit high error rates, in particular for insertions and deletions which are usually the most difficult errors to cope with. The only exact algorithm capable of aligning sequences with insertions and deletions is a dynamic programming algorithm. In this note, for the sake of efficiency, we consider dynamic programming in a band. We show how to choose the band width in function of the long reads’ error rates, thus obtaining an O ( N 3 2 ) $O(N^{\frac {3}{2}})$ algorithm in space and time. We also propose a procedure to decide whether this algorithm, when applied to semi-global alignments, provides the optimal score. We suggest that dynamic programming in a band is well suited to the problem of aligning long reads between themselves and can be used as a core component of methods for obtaining a consensus sequence from the long reads alone. The function implementing the dynamic programming algorithm in a band is available, as a standalone program, at: https://forgemia.inra.fr/jean-francois.gibrat/BAND_DYN_PROG.git

1 September 2011 in Discrete Applied Mathematics
Verified
Journal Article
Closed access
GCGuillaume Collet
Guillaume Collet
RARumen Andonov
Rumen Andonov
NYN. Yanev
N. Yanev
JGJ.-F. Gibrat
J.-F. Gibrat

1 January 2019 in Biophysics and Physicobiology
Verified
Journal Article
Open access
PDF file
JGJean-François Gibrat
Jean-François Gibrat
This paper presents a preliminary work consisting of two contributions. The first one is the design of a very efficient algorithm based on an “Overlap-Layout-Consensus” (OLC) graph to assemble the long reads provided by 3rd generation technologies. The second concerns the analysis of this graph using algebraic topology concepts to determine, in advance, whether the assembly of the genome will be straightforward, i.e., whether it will lead to a pseudo-Hamiltonian path or cycle, or whether the results will need to be scrutinized. In the latter case, it will be necessary to look for “loops” in the OLC assembly graph caused by unresolved repeated genomic regions, and then try to untie the “knots” created by these regions.