A GPU Accelerated Fragment-based De Novo Ligand Design by a Bayesian Optimization Algorithm

De Novo ligand design is an automatic fragment-based design of molecules within a protein binding site of a known structure. A Bayesian Optimization Algorithm (BOA), a meta-heuristic algorithm, is introduced to join predocked fragments with a user-supplied list of fragments. A novel feature proposed is the simultaneous optimization of force field energy and a term enforcing 3D-overlap to known binding mode(s). The performance of the algorithm is tested on Liver X receptors (LXRs) using a library of about 14, 000 fragments and the binding mode of a known heterocyclic phenyl acetic acid to bias the design. We further introduce the use of GPU (Graphics Processing Unit) to overcome the excessive time required in evaluating each possible fragment combination. We show how the GPU utilization enables experimenting larger fragment sets and target receptors for more complex instances. The results show how the nVidia's Tesla C2050 GPU was utilized to enable the generation of complex agonists effectively. In fact, eight of the 1, 809 molecules designed for LXRs are found in the ZINC database of commercially available compounds.

[1]  Richard E. Neapolitan,et al.  Learning Bayesian networks , 2007, KDD '07.

[2]  Sherry Sun,et al.  The Three-dimensional Structure of the Liver X Receptor β Reveals a Flexible Ligand-binding Pocket That Can Accommodate Fundamentally Different Ligands* , 2003, Journal of Biological Chemistry.

[3]  Ashish Ghosh,et al.  Hybrid-genetic algorithms for flexible ligand docking , 2007, J. Intell. Fuzzy Syst..

[4]  F. Lombardo,et al.  Experimental and computational approaches to estimate solubility and permeability in drug discovery and development settings. , 2001, Advanced drug delivery reviews.

[5]  F. Momany,et al.  Validation of the general purpose QUANTA ®3.2/CHARMm® force field , 1992 .

[6]  David Maxwell Chickering,et al.  Learning Bayesian Networks: The Combination of Knowledge and Statistical Data , 1994, Machine Learning.

[7]  Thomas Bäck,et al.  Evolutionary Algorithms in Drug Design , 2005, Natural Computing.

[8]  Petra Schneider,et al.  De novo design of molecular architectures by evolutionary assembly of drug-derived building blocks , 2000, J. Comput. Aided Mol. Des..

[9]  Stefan Svensson,et al.  Crystal structure of the heterodimeric complex of LXRα and RXRβ ligand‐binding domains in a fully agonistic conformation , 2003, The EMBO journal.

[10]  D. Goldberg,et al.  BOA: the Bayesian optimization algorithm , 1999 .

[11]  Heinz Mühlenbein,et al.  Schemata, Distributions and Graphical Models in Evolutionary Optimization , 1999, J. Heuristics.

[12]  Masaharu Munetomo,et al.  De novo ligand evolution using bayesian optimization algorithms , 2009 .

[13]  Klaus Schulten,et al.  Accelerating Molecular Modeling Applications with GPU Computing , 2009 .

[14]  Xavier Llorà,et al.  Evolutionary algorithms and de novo peptide design , 2006, Soft Comput..

[15]  Anthony Williams,et al.  Exhaustive de novo Design of Low-Molecular-Weight Fragments Against the ATP-Binding Site of DNA-Gyrase , 2006, J. Chem. Inf. Model..

[16]  G. Labesse,et al.  LEA3D: a computer-aided ligand design for structure-based drug design. , 2005, Journal of medicinal chemistry.

[17]  Erik Lindholm,et al.  NVIDIA Tesla: A Unified Graphics and Computing Architecture , 2008, IEEE Micro.

[18]  Luhua Lai,et al.  LigBuilder: A Multi-Purpose Program for Structure-Based Drug Design , 2000 .

[19]  Uli Fechner,et al.  Flux (2): Comparison of Molecular Mutation and Crossover Operators for Ligand-Based de Novo Design. , 2007 .

[20]  Hui Cheng,et al.  Rate distortion optimized document coding using resolution enhanced rendering , 2001, Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205).

[21]  David Heckerman,et al.  A Tutorial on Learning with Bayesian Networks , 1998, Learning in Graphical Models.

[22]  Asim Munawar,et al.  Theoretical and Empirical Analysis of a GPU Based Parallel Bayesian Optimization Algorithm , 2009, 2009 International Conference on Parallel and Distributed Computing, Applications and Technologies.

[23]  David E. Goldberg,et al.  Influence of selection and replacement strategies on linkage learning in BOA , 2007, 2007 IEEE Congress on Evolutionary Computation.

[24]  J. Irwin,et al.  ZINC ? A Free Database of Commercially Available Compounds for Virtual Screening. , 2005 .

[25]  Fred W. Glover,et al.  Tabu Search , 1997, Handbook of Heuristics.

[26]  Asim Munawar,et al.  Hybrid of genetic algorithm and local search to solve MAX-SAT problem using nVidia CUDA framework , 2009, Genetic Programming and Evolvable Machines.

[27]  Josef Schwarz,et al.  The Parallel Bayesian Optimization Algorithm , 2000 .

[28]  J. Apostolakis,et al.  Exhaustive docking of molecular fragments with electrostatic solvation , 1999, Proteins.

[29]  A. Caflisch,et al.  Automatic and efficient decomposition of two-dimensional structures of small molecules for fragment-based high-throughput docking. , 2006, Journal of medicinal chemistry.