Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Gilles Labesse

dblp:08/5980 · DBLP profile ↗
← Back
7ranked-venue papers
3as first author
0since 2021 · last 2020
0000-0002-6861-3300ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 7 · 3 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
7 papers
Bioinformatics and computational biology · 100%

Topics — the 15 heaviest of 17, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
drug discovery
0.412020
Towards accurate high-throughput ligand affinity prediction by exploiting structural ensembles, docking metrics and ligand similarity · Bioinform. 2020
Bioinformatics and computational biology › drug discovery
virtual screening
0.412020
Towards accurate high-throughput ligand affinity prediction by exploiting structural ensembles, docking metrics and ligand similarity · Bioinform. 2020
Bioinformatics and computational biology
structural bioinformatics
0.222020
Towards accurate high-throughput ligand affinity prediction by exploiting structural ensembles, docking metrics and ligand similarity · Bioinform. 2020
ViTO: tool for refinement of protein sequence-structure alignments · Bioinform. 2004
Bioinformatics and computational biology › molecular informatics › molecular modeling
molecular docking
0.112020
Towards accurate high-throughput ligand affinity prediction by exploiting structural ensembles, docking metrics and ligand similarity · Bioinform. 2020
Bioinformatics and computational biology
protein structure prediction
0.122001
Easier threading through web-based comparisons and cross-validations · Bioinform. 2001
Incremental threading optimization (TITO) to help alignment and modelling of remote homologues · Bioinform. 1998
Bioinformatics and computational biology › structural bioinformatics › protein structure representation
protein structure visualization
0.012004
ViTO: tool for refinement of protein sequence-structure alignments · Bioinform. 2004
Bioinformatics and computational biology › protein structure prediction › template-based modeling
fold recognition
0.012001
Easier threading through web-based comparisons and cross-validations · Bioinform. 2001
Bioinformatics and computational biology
protein structure analysis
0.011997
P-SEA: a new efficient assignment of secondary structure from C alpha trace of proteins · Comput. Appl. Biosci. 1997
Bioinformatics and computational biology › protein structure analysis › protein secondary structure analysis
secondary structure assignment
0.011997
P-SEA: a new efficient assignment of secondary structure from C alpha trace of proteins · Comput. Appl. Biosci. 1997
Bioinformatics and computational biology › sequence alignment
protein sequence alignment
0.011996
MulBlast 1.0: a multiple alignment of BLAST output to boost protein sequence similarity analysis · Comput. Appl. Biosci. 1996
Bioinformatics and computational biology › protein sequence analysis
protein similarity search
0.011995
Automat and BLAST: comparison of two protein sequence similarity search programs · Comput. Appl. Biosci. 1995
Bioinformatics and computational biology › sequence analysis
sequence similarity search
0.011995
Automat and BLAST: comparison of two protein sequence similarity search programs · Comput. Appl. Biosci. 1995
Bioinformatics and computational biology
protein sequence analysis
0.011998
Incremental threading optimization (TITO) to help alignment and modelling of remote homologues · Bioinform. 1998
Bioinformatics and computational biology › sequence analysis › homology detection
remote homology detection
0.011998
Incremental threading optimization (TITO) to help alignment and modelling of remote homologues · Bioinform. 1998
Bioinformatics and computational biology › sequence analysis › sequence similarity search
sequence database search
0.011995
Automat and BLAST: comparison of two protein sequence similarity search programs · Comput. Appl. Biosci. 1995

Methods — techniques the papers use, named apart from their topics

structure-based virtual screening · 0.4random forest · 0.4ligand-based virtual screening · 0.4multiple sequence alignment · 0.1comparative modelling · 0.0cross-validation · 0.0molecular modelling · 0.0recursive algorithm · 0.0finite state automaton · 0.0BLAST · 0.0
YearPublicationVenuePosition
2020 Towards accurate high-throughput ligand affinity prediction by exploiting structural ensembles, docking metrics and ligand similarity
abstract
MOTIVATION: Nowadays, virtual screening (VS) plays a major role in the process of drug development. Nonetheless, an accurate estimation of binding affinities, which is crucial at all stages, is not trivial and may require target-specific fine-tuning. Furthermore, drug design also requires improved predictions for putative secondary targets among which is Estrogen Receptor alpha (ERα). RESULTS: VS based on combinations of Structure-Based VS (SBVS) and Ligand-Based VS (LBVS) is gaining momentum to improve VS performances. In this study, we propose an integrated approach using ligand docking on multiple structural ensembles to reflect receptor flexibility. Then, we investigate the impact of the two different types of features (structure-based and ligand molecular descriptors) on affinity predictions using a random forest algorithm. We find that ligand-based features have lower predictive power (rP = 0.69, R2 = 0.47) than structure-based features (rP = 0.78, R2 = 0.60). Their combination maintains high accuracy (rP = 0.73, R2 = 0.50) on the internal test set, but it shows superior robustness on external datasets. Further improvement and extending the training dataset to include xenobiotics, leads to a novel high-throughput affinity prediction method for ERα ligands (rP = 0.85, R2 = 0.71). The presented prediction tool is provided to the community as a dedicated satellite of the @TOME server in which one can upload a ligand dataset in mol2 format and get ligand docked and affinity predicted. AVAILABILITY AND IMPLEMENTATION: http://edmon.cbs.cnrs.fr. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Melanie Schneider, Jean-Luc Pons, William Bourguet, Gilles Labesse
Bioinform.4
2004 ViTO: tool for refinement of protein sequence-structure alignments
abstract
UNLABELLED: ViTO is a graphical application, including an editor, of multiple sequence alignment and a three-dimensional (3D) structure viewer. It is possible to manipulate alignments containing hundreds of sequences and to display a dozen structures. ViTO can handle so-called 'multiparts' alignments to allow the visualization of complex structures (multi-chain proteins and/or small molecules and DNA) and the editing of the corresponding alignment. The 3D viewer and the alignment editor are connected together allowing rapid refinement of sequence-structure alignment by taking advantage of the immediate visualization of resulting insertions/deletions and strict conservations in their structural context. More generally, it allows the mapping of informations about the sequence conservation extracted from the alignment onto the 3D structures in a dynamic way. ViTO is also connected to two comparative modelling programs, SCWRL and MODELLER. These features make ViTO a powerful tool to characterize protein families and to optimize the alignments for comparative modelling. AVAILABILITY: http://bioserv.cbs.cnrs.fr/VITO/DOC/. SUPPLEMENTARY INFORMATION: http://bioserv.cbs.cnrs.fr/VITO/DOC/index.html.
Vincent Catherinot, Gilles Labesse
Bioinform.2
2001 Easier threading through web-based comparisons and cross-validations
abstract
UNLABELLED: We have developed a WWW server for the integration and comparison of protein structure predictions performed by five different servers. Users submit an amino acid sequence to a selected set of these prediction methods. Results are gathered on a web-based page in order to facilitate comparison and analysis. All the alignments are further evaluated through a common threading tool making their comparisons easier. AVAILABILITY: The meta-server is available free at http://www.infobiosud.cnrs.fr/bioserver SUPPLEMENTARY INFORMATION: http://www.infobiosud.cnrs.fr/bioserver/hah1.html
Dominique Douguet, Gilles Labesse
Bioinform.2
1998 Incremental threading optimization (TITO) to help alignment and modelling of remote homologues
abstract
MOTIVATION: Protein sequence comparison has become a major tool for biologists. Various methods have been designed in order to reveal even remote homologies among proteins. Sequence analyses are powerful, but the lower the identity score, the more skill and time are required to perform them accurately. While necessary to confirm the sequence comparison through the potential of mean force, sequence alignment and molecular modelling are still tedious and time-consuming tasks. RESULTS: In order to help sequence threading onto known three-dimensional (3D) structures, we have developed a new program, named TITO (Tool for Incremental Threading Optimization), which uses a multiple alignment to validate and help the refinement of a sequence/structure comparison. It measures the compatibility of a family of related sequences with a known 3D structure. The coordinates of the common core are extracted, allowing further molecular modelling and 3D survey. AVAILABILITY: TITO is available by anonymous ftp at: ftp://lmcp.jussieu. fr/pub/tito CONTACT: [email protected] SUPPLEMENTARY INFORMATION: http://www.lmcp.jussieu.fr/ approximately labesse/TITO/TITO.html
Gilles Labesse, J. P. Mornon
Bioinform.1
1997 P-SEA: a new efficient assignment of secondary structure from C alpha trace of proteins
abstract
MOTIVATION: The secondary structure is a key element of architectural organization in proteins. Accurate assignment of the secondary structure elements (SSE) (helix, strand, coil) is an essential step for the analysis and modelling of protein structure. Various methods have been proposed to assign secondary structure. Comparative studies of their results have shown some of their drawbacks, pointing out the difficulties in the task of SSE assignment. RESULTS: We have designed a new automatic method, named P-SEA, to assign efficiently secondary structure from the sole C alpha position. Some advantages of the new algorithm are discussed. AVAILABILITY: The program P-SEA is available by anonymous ftp: ftp.lmcp.jussieu.fr directory: pub/.
Gilles Labesse, N. Colloc'h, Joël Pothier, J. P. Mornon
Comput. Appl. Biosci.1
1996 MulBlast 1.0: a multiple alignment of BLAST output to boost protein sequence similarity analysis
abstract
The protein sequence similarity search has become a major tool for biologists. Various efficient and rapid programs and comparison matrices have been designed and refined in order to perform the scanning task (BLAST, FASTA, Automat, etc.). However, the final step of the search, the analysis of the results, is still tedious and time consuming. In order to optimize true-positive hit screening, we have developed a program which makes a multiple alignment from the BLAST search output. Conserved sequence segments are pointed out. It makes the recognition of already known as well as new sequence patterns easier. It allows at a glance a rapid identification of significant similarities, protein family signature and new sequence motifs. This alignment is written in a compatible format for the GCG programs LineUp and ProfileMake.
Gilles Labesse
Comput. Appl. Biosci.1
1995 Automat and BLAST: comparison of two protein sequence similarity search programs
abstract
Since the early 1980s, protein/DNA sequence similarity search has become of major importance to biologists, and the need for fast and efficient tools grows with the size of databanks. Two programs use the strategy of finite state deterministic automatons to accomplish these searches. One of these two is BLAST, which is now widely used, and the other Automat, which has just been published. The differences and similarities in their basic principles, their use and their performances are analysed in this paper in order to allow optimal use of these important softwares.
Hubert Cantalloube, Gilles Labesse, Jacques Chomilier, Carole E. Nahum, Y. Y. Cho, V. Chams, A. Achour, A. Lachgar, J. P. Mbika, W. Issing
Comput. Appl. Biosci.2