Evaluation of the FLEXX incremental construction algorithm for protein–ligand docking
✍ Scribed by Bernd Kramer; Matthias Rarey; Thomas Lengauer
- Publisher
- John Wiley and Sons
- Year
- 1999
- Tongue
- English
- Weight
- 822 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0887-3585
No coin nor oath required. For personal study only.
✦ Synopsis
We report on a test of FLEXX, a fully automatic docking tool for flexible ligands, on a highly diverse data set of 200 protein-ligand complexes from the Protein Data Bank. In total 46.5% of the complexes of the data set can be reproduced by a FLEXX docking solution at rank 1 with an rms deviation (RMSD) from the observed structure of less than 2 Å. This rate rises to 70% if one looks at the entire generated solution set. FLEXX produces reliable results for ligands with up to 15 components which can be docked in 80% of the cases with acceptable accuracy. Ligands with more than 15 components tend to generate wrong solutions more often. The average runtime of FLEXX on this test set is 93 seconds per complex on a SUN Ultra-30 workstation. In addition, we report on ''cross-docking'' experiments, in which several receptor structures of complexes with identical proteins have been used for docking all cocrystallized ligands of these complexes. In most cases, these experiments show that FLEXX can acceptably dock a ligand into a foreign receptor structure. Finally we report on screening runs of ligands out of a library with 556 entries against ten different proteins. In eight cases FLEXX is able to find the original inhibitor within the top 7% of the total library.
📜 SIMILAR VOLUMES
We have developed a generic evolutionary method with an empirical scoring function for the protein-ligand docking, which is a problem of paramount importance in structure-based drug design. This approach, referred to as the GEMDOCK (Generic Evolutionary Method for molecular DOCKing), combines both c
## Abstract The Biomolecular Ligand Energy Evaluation Protocol (BLEEP) is a knowledge‐based potential derived from high‐resolution X‐ray structures of protein–ligand complexes. The performance of this potential in ranking the hypothetical structures resulting from a docking study has been evaluated
Several global optimization algorithms were applied to the problem of molecular docking: random walk and Metropolis Monte Carlo Simulated Annealing as references, and Stochastic Approximation with Smoothing (SAS), and Terminal Repeller Unconstrained Subenergy Tunneling (TRUST) as new methodologies.
## Abstract Protein–ligand docking has made important progress during the last decade and has become a powerful tool for drug development, opening the way to virtual high throughput screening and __in silico__ structure‐based ligand design. Despite the flattering picture that has been drawn, recent