Molecular recognition of receptor sites using a genetic algorithm with a description of desolvation

Development and validation of a genetic algorithm for flexible docking

Prediction of small molecule binding modes to macromolecules of known three-dimensional structure is a problem of paramount importance in rational drug design (the "docking" problem). We report the development and validation of the program GOLD (Genetic Optimisation for Ligand Docking). GOLD is an automated ligand docking program that uses a genetic algorithm to explore the full range of ligand conformational flexibility with partial flexibility of the protein, and satisfies the fundamental requirement that the ligand must displace loosely bound water on binding. Numerous enhancements and modifications have been applied to the original technique resulting in a substantial increase in the reliability and the applicability of the algorithm. The advanced algorithm has been tested on a dataset of 100 complexes extracted from the Brookhaven Protein DataBank. When used to dock the ligand back into the binding site, GOLD achieved a 71% success rate in identifying the experimental binding mode.

Molecular docking to ensembles of protein structures

Until recently, applications of molecular docking assumed that the macromolecular receptor exists in a single, rigid conformation. However, structural studies involving different ligands bound to the same target biomolecule frequently reveal modest but significant conformational changes in the target. In this paper, two related methods for molecular docking are described that utilize information on conformational variability from ensembles of experimental receptor structures. One method combines the information into an "energy-weighted average" of the interaction energy between a ligand and each receptor structure. The other method performs the averaging on a structural level, producing a "geometry-weighted average" of the inter-molecular force field score used in DOCK 3.5. Both methods have been applied in docking small molecules to ensembles of crystal and solution structures, and we show that experimentally determined binding orientations and computed energies of known ligands can be reproduced accurately. The use of composite grids, when conformationally different protein structures are available, yields an improvement in computational speed for database searches in proportion to the number of structures.

Hydrophobic regions on protein surfaces. Derivation of the solvation energy from their area distribution in crystallographic protein structures

For the first time, a direct approach for the derivation of an atomic solvation parameter from macromolecular structural data alone is presented. The specific free energy of solvation for hydrophobic surface regions of proteins is delineated from the area distribution of hydrophobic surface patches. The resulting value is 18 cal/(mol.A2), with a statistical uncertainty of +/-2 cal/mol.A2) at the 5% significance level. It compares favorably with the parameters for carbon obtained by other authors who use the the crystal geometry of succinic acid or energies of transfer from hydrophobic solvent to water for small organic compounds. Thus, the transferability of atomic solvation parameters for hydrophobic atoms to macromolecules has been directly demonstrated. A careful statistical analysis demonstrates that surface energy parameters derived from thermodynamic data of protein mutation experiments are clearly less confident.

Current computational tools for de novo ligand design

Several new algorithms have been proposed recently for computational de novo ligand design. Empirical scoring functions are now available to prioritize the suggested structures. The first successful applications have been reported.

Evolutionary algorithms in computer-aided molecular design

In recent years, search and optimisation algorithms inspired by evolutionary processes have been applied with marked success to a wide variety of problems in diverse fields of study. In this review, we survey the growing application of these 'evolutionary algorithms' in one such area: computer-aided molecular design. In the course of the review, we seek to summarise the work to date and to indicate where evolutionary algorithms have met with success and where they have not fared so well. In addition to this, we also attempt to discern some future trends in both the basic research concerning these algorithms and their application to the elucidation, design and modelling of chemical and biochemical structures.

Computational methods for biomolecular docking

With the rapidly increasing amount of molecular biological data available, the computer-based analysis of molecular interactions becomes more and more feasible. Methods for computer-aided molecular docking have to include a reasonably accurate model of energy and must be able to deal with the combinatorial complexity incurred by the molecular flexibility of the docking partners. In both respects, recent years have seen substantial progress.

Molecular docking using surface complementarity

A method is described to dock a ligand into a binding site in a protein on the basis of the complementarity of the intermolecular atomic contacts. Docking is performed by maximization of a complementarity function that is dependent on atomic contact surface area and the chemical properties of the contacting atoms. The generality and simplicity of the complementarity function ensure that a wide range of chemical structures can be handled. The ligand and the protein are treated as rigid bodies, but displacement of a small number of residues lining the ligand binding site can be taken into account. The method can assist in the design of improved ligands by indicating what changes in complementarity may occur as a result of the substitution of an atom in the ligand. The capabilities of the method are demonstrated by application to 14 protein-ligand complexes of known crystal structure.

Empirical free energy as a target function in docking and design: application to HIV-1 protease inhibitors

Structure-based drug design requires the development of efficient computer programs for exploring the structural compatibility of various flexible ligands with a given receptor. While various algorithms are available for finding docked conformations, selecting a target function that can reliably score the conformations remains a serious problem. We show that the use of an empirical free energy evaluation method, originally developed to characterize protein-protein interactions, can substantially improve the efficacy of search algorithms. In addition to the molecular mechanics interaction energy, the function takes account of solvation and side chain conformational entropy, while remaining simple enough to replace the incomplete target functions used in many drug docking and design procedures. The free energy function is used here in conjunction with a simple site mapping-fragment assembly algorithm, for docking the MVT-101 non-peptide inhibitor to HIV-1 protease. In particular, we predict the bound structure with an all atom RMSD of 1.21 A, compared to 1.69 A using an energy target function, and also accurately predict the free energy shifts obtained with a series of five trimeric hydroxyethylene isostere analogs.

Modeling protein-ligand complexes

Increasing the rate at which new biologically active compounds are found is a major goal in pharmaceutical chemistry. Recently, several computational methods have been proposed with this intent. For some time, algorithms have been used to direct ligand evolution on the basis of complementarity to the three-dimensional structure of a selected protein. Current research focuses on enhancements to methods for searching chemical databases, proposing sensible modifications to known active compounds, and construction of novel ligands from theoretical principles.

New approaches in molecular structure prediction

In the past years, much effort has been put on the development of new methodologies and algorithms for the prediction of protein secondary and tertiary structures from (sequence) data; this is reviewed in detail. New approaches for these predictions such as neural network methods, genetic algorithms, machine learning, and graph theoretical methods are discussed. Secondary structure prediction algorithms were improved mostly by considering families of related proteins; however, for the reliable tertiary structure modeling of proteins, knowledge-based techniques are still preferred. Methods and examples with more or less successful results are described. Also, programs and parameterizations for energy minimisations, molecular dynamics, and electrostatic interactions have been improved, especially with respect to their former limits of applicability. Other topics discussed in this review include the use of traditional and on-line databases, the docking problem and surface properties of biomolecules, packing of protein cores, de novo design and protein engineering, prediction of membrane protein structures, the verification and reliability of model structures, and progress made with currently available software and computer hardware. In summary, the prediction of the structure, function, and other properties of a protein is still possible only within limits, but these limits continue to be moved.

Molecular docking towards drug discovery

Fueled by advances in molecular structure determination, tools for structure-based drug design are proliferating rapidly. Lead discovery through searching of ligand databases with molecular docking techniques represents an attractive alternative to high-throughout random screening. The size of commercial databases imposes severe computational constraints on molecular docking, compromising the level of calculational detail permitted for each putative ligand. We describe alternative philosophies for docking which effectively address this challenge. With respect to the dynamic aspects of molecular recognition, these strategies lie along a spectrum of models bounded by the Lock-and-Key and Induced-Fit theories for ligand binding. We explore the potential of a rigid model in exploiting species specificity and of a tolerant model in predicting absolute ligand binding affinity. Current molecular docking methods are limited primarily by their ability to rank docked complexes; we therefore place particular emphasis on this aspect of the problem throughout our validation of docking strategies.

Genetic algorithms in molecular recognition and design

Genetic algorithms provide a novel tool for the investigation of combinatorial optimization problems. A genetic algorithm takes an initial set of possible starting solutions, and iteratively improves them by means of crossover and mutation operators that are related to those involved in Darwinian evolution. This approach is illustrated by reference to applications in molecular modelling, the docking of flexible ligands into protein active sites and de novo ligand design.

Docking small-molecule ligands into active sites

Docking involves the development of computer algorithms that evaluate the binding modes of putative ligands in receptor sites. The principal advances of the past year have been the development of new algorithmic approaches, several of which incorporate conformational flexibility, and the increased use of docking to identify leads in drug-discovery programmes.

A genetic algorithm for flexible molecular overlay and pharmacophore elucidation

A genetic algorithm (GA) has been developed for the superimposition of sets of flexible molecules. Molecules are represented by a chromosome that encodes angles of rotation about flexible bonds and mappings between hydrogen-bond donor proton, acceptor lone pair and ring centre features in pairs of molecules. The molecule with the smallest number of features in the data set is used as a template, onto which the remaining molecules are fitted with the objective of maximising structural equivalences. The fitness function of the GA is a weighted combination of: (i) the number and the similarity of the features that have been overlaid in this way; (ii) the volume integral of the overlay; and (iii) the van der Waals energy of the molecular conformations defined by the torsion angles encoded in the chromosomes. The algorithm has been applied to a number of pharmacophore elucidation problems, i.e., angiotensin II receptor antagonists, Leu-enkephalin and a hybrid morphine molecule, 5-HT1D agonists, benzodiazepine receptor ligands, 5-HT3 antagonists, dopamine D2 antagonists, dopamine reuptake blockers and FKBP12 ligands. The resulting pharmacophores are generated rapidly and are in good agreement with those derived from alternative means.

Characterising the geometric diversity of functional groups in chemical databases

We have developed a program, HookSpace, which provides a simplistic approach to assessing the diversity of molecular databases. The spatial relationship between pairs of intramolecular functional groups can be analysed in a variety of ways to provide both qualitative and quantitative measures of diversity. Results are described and contrasted for two commercially available databases and a combinatorial library of benzodiazepam derivatives. HookSpace highlights the main differences in molecular content of these data sets.