1. Optimization of compound ranking for structure-based virtual ligand screening using an established FRED-Surflex consensus approach
- Author
-
I.W.M. Bleylevens, Gerry A. F. Nicolaes, Jiangfeng Du, Kanin Wichapong, Albert V. Bitorina, RS: FSE DACS, RS: CARIM - R1 - Thrombosis and haemostasis, Klinische Genetica, Dept. of Advanced Computing Sciences, and Biochemie
- Subjects
Computer science ,Machine learning ,computer.software_genre ,Biochemistry ,Molecular Docking Simulation ,Software ,Drug Discovery ,Pharmacology ,Virtual screening ,business.industry ,Organic Chemistry ,Scoring methods ,Proteins ,Multiple target ,Protein Structure, Tertiary ,Data set ,ROC Curve ,Docking (molecular) ,Drug Design ,Molecular Medicine ,Structure based ,Artificial intelligence ,business ,computer - Abstract
The use of multiple target conformers has been applied successfully in virtual screening campaigns; however, a study on how to best combine scores for multiple targets in a hierarchic method that combines rigid and flexible docking is not available. In this study, we used a data set of 59 479 compounds to screen multiple conformers of four distinct protein targets to obtain an adapted and optimized combination of an established hierarchic method that employs the programs FRED and Surflex. Our study was extended and verified by application of our protocol to ten different data sets from the directory of useful decoys (DUD). We quantitated overall method performance in ensemble docking and compared several consensus scoring methods to improve the enrichment during virtual ligand screening. We conclude that one of the methods used, which employs a consensus weighted scoring of multiple target conformers, performs consistently better than methods that do not include such consensus scoring. For optimal overall performance in ensemble docking, it is advisable to first calculate a consensus of FRED results and use this consensus as a sub-data set for Surflex screening. Furthermore, we identified an optimal method for each of the chosen targets and propose how to optimize the enrichment for any target.
- Published
- 2014