Improving conformational searches by geometric screening

MOTIVATION Conformational searches in molecular docking are a time-consuming process with wide range of applications. Favorable conformations of the ligands that successfully bind with receptors are sought to form stable ligand-receptor complexes. Usually a large number of conformations are generated and their binding energies are examined. We propose adding a geometric screening phase before an energy minimization procedure so that only conformations that geometrically fit in the binding site will be prompted for energy calculation. RESULTS Geometric screening can drastically reduce the number of conformations to be examined from millions (or higher) to thousands (or lower). The method can also handle cases when there are more variables than geometric constraints. An early-stage implementation is able to finish the geometric filtering of conformations for molecules with up to nine variables in 1 min. To the best of our knowledge, this is the first time such results are reported deterministically. CONTACT mzhang@mdanderson.org.

[1]  Thomas Lengauer,et al.  Placement of medium-sized molecular fragments into active sites of proteins , 1996, J. Comput. Aided Mol. Des..

[2]  Lydia E. Kavraki,et al.  Computational Approaches to Drug Design , 1999, Algorithmica.

[3]  Claudio N. Cavasotto,et al.  Protein flexibility in ligand docking and virtual screening to protein kinases. , 2004, Journal of molecular biology.

[4]  Ruben Abagyan,et al.  Comparative study of several algorithms for flexible ligand docking , 2003, J. Comput. Aided Mol. Des..

[5]  Dinesh Manocha.  Numerical Methods for Solving Polynomial Equations , 1998 .

[6]  Lydia E. Kavraki,et al.  A randomized kinematics‐based approach to pharmacophore‐constrained conformational search and database screening , 2000 .

[7]  Charles L. Brooks,et al.  Assessing search strategies for flexible docking , 1998, J. Comput. Chem..

[8]  Gerhard Klebe,et al.  Recent developments in structure-based drug design , 2000, Journal of Molecular Medicine.

[9]  D J Diller,et al.  High throughput docking for library design and library prioritization , 2001, Proteins.

[10]  N. Baurin.  Drug-Like Annotation and Duplicate Analysis of a 23-Supplier Chemical Database Totalling 2.7 Million Compounds. , 2004 .

[11]  Youngshang Pak,et al.  Application of a Molecular Dynamics Simulation Method with a Generalized Effective Potential to the Flexible Molecular Docking Problems , 2000 .

[12]  Ming Zhang,et al.  A New Method for Fast and Accurate Derivation of Molecular Conformations , 2002, J. Chem. Inf. Comput. Sci..

[13]  Nicolas Foloppe,et al.  Drug-like Annotation and Duplicate Analysis of a 23-Supplier Chemical Database Totalling 2.7 Million Compounds , 2004, J. Chem. Inf. Model..

[14]  P Willett,et al.  Development and validation of a genetic algorithm for flexible docking. , 1997, Journal of molecular biology.

[15]  P. Charifson,et al.  Conformational analysis of drug-like molecules bound to proteins: an extensive study of ligand reorganization upon binding. , 2004, Journal of medicinal chemistry.

[16]  Nancy M. Amato,et al.  Using Motion Planning to Study Protein Folding Pathways , 2002, J. Comput. Biol..

[17]  Fabrice Rouillier,et al.  Real Solving for Positive Dimensional Systems , 2002, J. Symb. Comput..

[18]  Marie-Françoise Roy,et al.  Counting real zeros in the multivariate case , 1993 .

[19]  Chaok Seok,et al.  A kinematic view of loop closure , 2004, J. Comput. Chem..

[20]  Bernard Mourrain,et al.  Computer Algebra Methods for Studying and Computing Molecular Conformations , 1999, Algorithmica.

[21]  W. Press,et al.  Numerical Recipes: The Art of Scientific Computing , 1987 .

[22]  A. Kidera,et al.  Multicanonical Ensemble Generated by Molecular Dynamics Simulation for Enhanced Conformational Sampling of Peptides , 1997 .

[23]  J. Maurice Rojas.  Some Speed-Ups and Speed Limits for Real Algebraic Geometry , 2000, J. Complex..

[24]  A. Sali,et al.  Protein Structure Prediction and Structural Genomics , 2001, Science.

[25]  Gennady Verkhivker,et al.  Deciphering common failures in molecular docking of ligand-protein complexes , 2000, J. Comput. Aided Mol. Des..

[26]  Ron Goldman,et al.  Pyramid algorithms - a dynamic programming approach to curves and surfaces for geometric modeling , 2002, Morgan Kaufmann series in computer graphics and geometric modeling.

[27]  Natasja Brooijmans,et al.  Molecular recognition and docking algorithms. , 2003, Annual review of biophysics and biomolecular structure.

[28]  Thomas Lengauer,et al.  Evaluation of the FLEXX incremental construction algorithm for protein–ligand docking , 1999, Proteins.

[29]  Ming Zhang,et al.  A MOLECULAR INVERSE KINEMATICS PROBLEM: AN APPROXIMATION APPROACH AND CHALLENGES , 2003 .

[30]  Todd J. A. Ewing,et al.  DOCK 4.0: Search strategies for automated molecular docking of flexible molecule databases , 2001, J. Comput. Aided Mol. Des..

[31]  Douglas R. Henry,et al.  Conformational Flexibility in 3D Structure Searching , 2002 .

[32]  R Samudrala,et al.  Constructing side chains on near-native main chains for ab initio protein structure prediction. , 2000, Protein engineering.