Computational Approaches to Drug Design

Abstract. The rational approach to pharmaceutical drug design begins with an investigation of the relationship between chemical structure and biological activity. Information gained from this analysis is used to aid the design of new, or improved, drugs. Primary considerations during this investigation are the geometric and chemical characteristics of the molecules. Computational chemists who are involved in rational drug design routinely use an array of programs to compute, among other things, molecular surfaces and molecular volume, models of receptor sites, dockings of ligands inside protein cavities, and geometric invariants among different molecules that exhibit similar activity. There is a pressing need for efficient and accurate solutions to the above problems. {Often, limiting assumptions need to be made, in order to make the calculations tractable. Also,} the amount of data processed when searching for a potential drug is currently very large and is only expected to grow larger in the future. This paper describes some areas of computer-aided drug design that are important to computational chemists but are also rich in algorithmic problems. It surveys recent work in these areas both from the computational chemistry and the computer science literature.

[1]  Owen Johnson,et al.  The development of versions 3 and 4 of the Cambridge Structural Database System , 1991, J. Chem. Inf. Comput. Sci..

[2]  R S Bohacek,et al.  Definition and display of steric, hydrophobic, and hydrogen-bonding properties of ligand binding sites in proteins using Lee and Richards accessible surface: validation of a high-resolution graphical tool for drug design. , 1992, Journal of medicinal chemistry.

[3]  Rajeev Motwani,et al.  Dynamic Maintenance of Kinematic Structures , 1995 .

[4]  M. Lawrence,et al.  CLIX: A search algorithm for finding novel ligands capable of binding proteins of known three‐dimensional structure , 1992, Proteins.

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6]  Kenneth M. Merz,et al.  Rapid approximation to molecular surface area via the use of Boolean logic and look‐up tables , 1993, J. Comput. Chem..

[7]  F. F. Yao,et al.  Approximation Algorithms for the Largest Common Subtree Problem. , 1995 .

[8]  Yvonne C. Martin,et al.  ALADDIN: An integrated tool for computer-assisted molecular design and pharmacophore recognition from geometric, steric, and substructure searching of three-dimensional molecular structures , 1989, J. Comput. Aided Mol. Des..

[9]  Thomas Lengauer,et al.  Algorithmic research problems in molecular bioinformatics , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

[10]  C. Frömmel,et al.  The automatic search for ligand binding sites in proteins of known three-dimensional structure using only geometric criteria. , 1996, Journal of molecular biology.

[11]  J. Scott Dixon,et al.  Flexible ligand docking using a genetic algorithm , 1995, J. Comput. Aided Mol. Des..

[12]  Steven L. Teig,et al.  Chemical Function Queries for 3D Database Search , 1994, J. Chem. Inf. Comput. Sci..

[13]  P Willett,et al.  Searching for pharmacophoric patterns in databases of three‐dimensional chemical structures , 1995, Journal of molecular recognition : JMR.

[14]  K. D. Gibson,et al.  Exact calculation of the volume and surface area of fused hard-sphere molecules with unequal atomic radii , 1987 .

[15]  Barry Robson,et al.  Novel algorithms for searching conformational space , 1994, J. Comput. Aided Mol. Des..

[16]  Teofilo F. GONZALEZ,et al.  Clustering to Minimize the Maximum Intercluster Distance , 1985, Theor. Comput. Sci..

[17]  Phillip J. McKerrow,et al.  Introduction to robotics , 1991 .

[18]  Andrew Smellie,et al.  Analysis of Conformational Coverage, 2. Applications of Conformational Models , 1995, J. Chem. Inf. Comput. Sci..

[19]  E. Katchalski‐Katzir,et al.  Molecular surface recognition: determination of geometric fit between proteins and their ligands by correlation techniques. , 1992, Proceedings of the National Academy of Sciences of the United States of America.

[20]  I. Haneef,et al.  A robust and efficient automated docking algorithm for molecular recognition. , 1992, Protein engineering.

[21]  Gennady M Verkhivker,et al.  Exploring the energy landscapes of molecular recognition by a genetic algorithm: analysis of the requirements for robust docking of HIV-1 protease and FKBP-12 complexes. , 1996, Proteins.

[22]  Alberto L. Sangiovanni-Vincentelli,et al.  Chain Closure: A Problem in Molecular CAD , 1994, 31st Design Automation Conference.

[23]  Paul W. Finn,et al.  Computer-based screening of compound databases for the identification of novel leads , 1996 .

[24]  H. Edelsbrunner The union of balls and its dual shape , 1995 .

[25]  Daniel A. Gschwend,et al.  Orientational sampling and rigid‐body minimization in molecular docking , 1993, Proteins.

[26]  Hans-Joachim Böhm,et al.  The development of a simple empirical scoring function to estimate the binding constant for a protein-ligand complex of known three-dimensional structure , 1994, J. Comput. Aided Mol. Des..

[27]  B. Lee,et al.  The interpretation of protein structures: estimation of static accessibility. , 1971, Journal of molecular biology.

[28]  Tatsuya Akutsu,et al.  On the approximation of largest common subtrees and largest common point sets , 2000, Theor. Comput. Sci..

[29]  D. Rich,et al.  Peptidomimetics derived from natural products , 1993, Medicinal research reviews.

[30]  Gerhard Klebe,et al.  A fast and efficient method to generate biologically relevant conformations , 1994, J. Comput. Aided Mol. Des..

[31]  Thomas Lengauer,et al.  Computational methods for biomolecular docking. , 1996, Current opinion in structural biology.

[32]  Tatsuya Akutsu,et al.  Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets , 1998, Discret. Comput. Geom..

[33]  Andrew Smellie,et al.  Poling: Promoting conformational variation , 1995, J. Comput. Chem..

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

[35]  W. Grimson,et al.  Model-Based Recognition and Localization from Sparse Range or Tactile Data , 1984 .

[36]  Nelson L. Max,et al.  Spherical harmonic molecular surfaces , 1988, IEEE Computer Graphics and Applications.

[37]  D. Goodsell,et al.  Automated docking of substrates to proteins by simulated annealing , 1990, Proteins.

[38]  I. Kuntz,et al.  Molecular docking to ensembles of protein structures. , 1997, Journal of molecular biology.

[39]  Philip M. Dean,et al.  An exploration of a novel strategy for superposing several flexible molecules , 1993, J. Comput. Aided Mol. Des..

[40]  Frederick P. Brooks,et al.  Computing smooth molecular surfaces , 1994, IEEE Computer Graphics and Applications.

[41]  Yvonne C. Martin,et al.  A fast new approach to pharmacophore mapping and its application to dopaminergic and benzodiazepine agonists , 1993, J. Comput. Aided Mol. Des..

[42]  Gareth Jones,et al.  A genetic algorithm for flexible molecular overlay and pharmacophore elucidation , 1995, J. Comput. Aided Mol. Des..

[43]  Tatsuya Akutsu On Determining the Congruity of Point Sets in Higher Dimensions , 1994, ISAAC.

[44]  Andrew R. Leach An Algorithm To Directly Identify a Molecule's "Most Different" Conformations , 1994, J. Chem. Inf. Comput. Sci..

[45]  M. Levitt,et al.  The volume of atoms on the protein surface: calculated from simulation, using Voronoi polyhedra. , 1995, Journal of molecular biology.

[46]  M. L. Connolly Analytical molecular surface calculation , 1983 .

[47]  Lydia E. Kavraki,et al.  Geometric Manipulation of Flexible Ligands , 1996, WACG.

[48]  D Fischer,et al.  A computer vision based technique for 3-D sequence-independent structural comparison of proteins. , 1993, Protein engineering.

[49]  Robert P. Sheridan,et al.  Chemical Similarity Using Geometric Atom Pair Descriptors , 1996, J. Chem. Inf. Comput. Sci..

[50]  F. Richards The interpretation of protein structures: total volume, group volume distributions and packing density. , 1974, Journal of molecular biology.

[51]  J. J. Müller Calculation of scattering curves for macromolecules in solution and comparison with results of methods using effective atomic scattering factors , 1983 .

[52]  W. Guida,et al.  Probing the conformational space available to inhibitors in the thermolysin active site using Monte Carlo/energy minimization techniques , 1992 .

[53]  M. L. Connolly Shape complementarity at the hemoglobin alpha 1 beta 1 subunit interface. , 1986, Biopolymers.

[54]  I. Kuntz,et al.  Conformational analysis of flexible ligands in macromolecular receptor sites , 1992 .

[55]  Olivier Faugeras,et al.  Three-Dimensional Computer Vision , 1993 .

[56]  Herbert Edelsbrunner,et al.  Measuring proteins and voids in proteins , 1995, Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences.

[57]  N. Go,et al.  Ring Closure and Local Conformational Deformations of Chain Molecules , 1970 .

[58]  Eric Fontain,et al.  Application of genetic algorithms in the field of constitutional similarity , 1992, J. Chem. Inf. Comput. Sci..

[59]  Gerhard Klebe,et al.  Structure Correlation and Ligand/Receptor Interactions , 1994 .

[60]  G. Chang,et al.  An internal-coordinate Monte Carlo method for searching conformational space , 1989 .

[61]  P. Goodford A computational procedure for determining energetically favorable binding sites on biologically important macromolecules. , 1985, Journal of medicinal chemistry.

[62]  F M Richards,et al.  Areas, volumes, packing and protein structure. , 1977, Annual review of biophysics and bioengineering.

[63]  John F. Canny,et al.  Geometric Problems in Molecular Biology and Robotics , 1994, ISMB.

[64]  Richard K. Moore,et al.  From theory to applications , 1986 .

[65]  A. Leach A Survey of Methods for Searching the Conformational Space of Small and Medium‐Sized Molecules , 1992 .

[66]  Ruth Nussinov,et al.  3-D Substructure Matching in Protein Molecules , 1992, CPM.

[67]  Thomas Lengauer,et al.  Time-Efficient Docking of Flexible Ligands into Active Sites of Proteins , 1995, ISMB.

[68]  Mark H. Overmars,et al.  Spheres, molecules, and hidden surface removal , 1998, Comput. Geom..

[69]  Rajeev Motwani,et al.  Incremental clustering and dynamic information retrieval , 1997, STOC '97.

[70]  D A Pierre,et al.  Optimization Theory with Applications , 1986 .

[71]  Brian K. Shoichet,et al.  Molecular docking using shape descriptors , 1992 .

[72]  D. Manocha,et al.  Algebraic and numeric techniques in modeling and robotics , 1992 .

[73]  Piotr Indyk,et al.  Geometric matching under noise: combinatorial bounds and algorithms , 1999, SODA '99.

[74]  Λυδια Καβρακη,et al.  RANDOM NETWORKS IN CONFIGURATION SPACE FOR FAST PATH PLANNING , 1994 .

[75]  Tomas Lozano-Perez,et al.  Model-Based Recognition and Localization from Sparse Range Data , 1986 .

[76]  M C Nicklaus,et al.  Conformational changes of small molecules binding to proteins. , 1995, Bioorganic & medicinal chemistry.

[77]  Bernard Roth,et al.  Kinematic analysis of the 6R manipulator of general geometry , 1991 .

[78]  Hans-Peter Lenhof,et al.  New contact measures for the protein docking problem , 1997, RECOMB '97.

[79]  S. Kim,et al.  "Soft docking": matching of molecular surface cubes. , 1991, Journal of molecular biology.

[80]  P. Mezey The topology of molecular surfaces and shape graphs , 1990 .

[81]  Coenraad Bron,et al.  Finding all cliques of an undirected graph , 1973 .

[82]  A. K. Ghose,et al.  Conformational searching methods for small molecules. I. Study of the sybyl search method , 1993, J. Comput. Chem..

[83]  Jay W. Ponder,et al.  Algorithms for calculating excluded volume and its derivatives as a function of molecular conformation and their use in energy minimization , 1991 .

[84]  Tatsuya Akutsu,et al.  On the approximation of largest common subtrees and largest common point sets , 1994, Theor. Comput. Sci..

[85]  J. Janin,et al.  Analytical approximation to the accessible surface area of proteins. , 1980, Proceedings of the National Academy of Sciences of the United States of America.

[86]  J M Blaney,et al.  A geometric approach to macromolecule-ligand interactions. , 1982, Journal of molecular biology.

[87]  Gareth Jones,et al.  Pharmacophoric pattern matching in files of three-dimensional chemical structures: Comparison of conformational-searching algorithms for flexible searching , 1994, J. Chem. Inf. Comput. Sci..

[88]  W. C. Still,et al.  The multiple minimum problem in molecular modeling. Tree searching internal coordinate conformational space , 1988 .

[89]  Lydia E. Kavraki,et al.  RAPID: randomized pharmacophore identification for drug design , 1997, SCG '97.

[90]  Herbert Edelsbrunner,et al.  On the Definition and the Construction of Pockets in Macromolecules , 1998, Discret. Appl. Math..

[91]  Dan Halperin,et al.  A perturbation scheme for spherical arrangements with application to molecular modeling , 1997, SCG '97.

[92]  G J Williams,et al.  The Protein Data Bank: a computer-based archival file for macromolecular structures. , 1978, Archives of biochemistry and biophysics.

[93]  J. Scott Dixon,et al.  A good ligand is hard to find: Automated docking methods , 1993 .

[94]  Tad Hurst,et al.  Flexible 3D searching: The directed tweak technique , 1994, J. Chem. Inf. Comput. Sci..

[95]  D. K. Friesen,et al.  A combinatorial algorithm for calculating ligand binding , 1984 .

[96]  K. D. Gibson,et al.  Surface area of the intersection of three spheres with unequal radii A simplified analytical formula , 1988 .

[97]  K. Dill Folding proteins: finding a needle in a haystack , 1993 .

[98]  Gordon M. Crippen,et al.  Distance Geometry and Molecular Conformation , 1988 .

[99]  P A Kollman,et al.  Absolute and relative binding free energy calculations of the interaction of biotin and its analogs with streptavidin using molecular dynamics/free energy perturbation approaches , 1993, Proteins.

[100]  Lydia E. Kavraki,et al.  Geometry and the Discovery of New Ligands , 1996 .

[101]  Peter Willett,et al.  Algorithms for the identification of three-dimensional maximal common substructures , 1987, J. Chem. Inf. Comput. Sci..

[102]  Robert P. Sheridan,et al.  FLOG: A system to select ‘quasi-flexible’ ligands complementary to a receptor of known three-dimensional structure , 1994, J. Comput. Aided Mol. Des..

[103]  R. Glen,et al.  Computer-aided design and synthesis of 5-substituted tryptamines and their pharmacology at the 5-HT1D receptor: discovery of compounds with potential anti-migraine properties. , 1995, Journal of medicinal chemistry.

[104]  Robert P. Sheridan,et al.  Flexibases: A way to enhance the use of molecular docking methods , 1994, J. Comput. Aided Mol. Des..

[105]  M L Connolly,et al.  The molecular surface package. , 1993, Journal of molecular graphics.

[106]  Philip M. Dean,et al.  Molecular surface-volume and property matching to superpose flexible dissimilar molecules , 1995, J. Comput. Aided Mol. Des..

[107]  Yehezkel Lamdan,et al.  Geometric Hashing: A General And Efficient Model-based Recognition Scheme , 1988, [1988 Proceedings] Second International Conference on Computer Vision.

[108]  A. N. Jain,et al.  Hammerhead: fast, fully automated docking of flexible ligands to protein binding sites. , 1996, Chemistry & biology.

[109]  Cyrus Levinthal,et al.  A vectorized algorithm for calculating the accessible surface area of macromolecules , 1991 .

[110]  Dinesh Manocha,et al.  Conformational analysis of molecular chains using nano-kinematics , 1995, Comput. Appl. Biosci..

[111]  H. Wolfson,et al.  Molecular surface recognition by a computer vision-based technique. , 1994, Protein engineering.

[112]  Robert P. Sheridan,et al.  Docking Flexible Ligands to Macromolecular Receptors by Molecular Shape. , 1987 .