Matthias Keil

Pattern recognition strategies for molecular surfaces: III. Binding site prediction with a neural network

An algorithm for the identification of possible binding sites of biomolecules, which are represented as regions of the molecular surface, is introduced. The algorithm is based on the segmentation of the molecular surface into overlapping patches as described in the first article of this series. 1 The properties of these patches (calculated on the basis of physical and chemical properties) are used for the analysis of the molecular surfaces of 7821 proteins and protein complexes. Special attention is drawn to known protein binding sites. A binding site identification algorithm is realized on the basis of the calculated data using a neural network strategy. The neural network is able to classify surface patches as protein–protein, protein–DNA, protein–ligand, or nonbinding sites. To show the capability of the algorithm, results of the surface analysis and the predictions are presented and discussed with representative examples.

Pattern recognition strategies for molecular surfaces. I: Pattern generation using fuzzy set theory

A new method for the characterization of molecules based on the model approach of molecular surfaces is presented. We use the topographical properties of the surface as well as the electrostatic potential, the local lipophilicity/hydrophilicity, and the hydrogen bond density on the surface for characterization. The definition and the calculation method for these properties are reviewed shortly. The surface is segmented into overlapping patches with similar molecular properties. These patches can be used to represent the characteristic local features of the molecule in a way that is beyond the atomistic resolution but can nevertheless be applied for the analysis of partial similarities of different molecules as well as for the identification of molecular complementarity in a very general sense. The patch representation can be used for different applications, which will be demonstrated in subsequent articles.

Are predefined decoy sets of ligand poses able to quantify scoring function accuracy

Due to the large number of different docking programs and scoring functions available, researchers are faced with the problem of selecting the most suitable one when starting a structure-based drug discovery project. To guide the decision process, several studies comparing different docking and scoring approaches have been published. In the context of comparing scoring function performance, it is common practice to use a predefined, computer-generated set of ligand poses (decoys) and to reevaluate their score using the set of scoring functions to be compared. But are predefined decoy sets able to unambiguously evaluate and rank different scoring functions with respect to pose prediction performance? This question arose when the pose prediction performance of our piecewise linear potential derived scoring functions (Korb et al. in J Chem Inf Model 49:84–96, 2009) was assessed on a standard decoy set (Cheng et al. in J Chem Inf Model 49:1079–1093, 2009). While they showed excellent pose identification performance when they were used for rescoring of the predefined decoy conformations, a pronounced degradation in performance could be observed when they were directly applied in docking calculations using the same test set. This implies that on a discrete set of ligand poses only the rescoring performance can be evaluated. For comparing the pose prediction performance in a more rigorous manner, the search space of each scoring function has to be sampled extensively as done in the docking calculations performed here. We were able to identify relative strengths and weaknesses of three scoring functions (ChemPLP, GoldScore, and Astex Statistical Potential) by analyzing the performance for subsets of the complexes grouped by different properties of the active site. However, reasons for the overall poor performance of all three functions on this test set compared to other test sets of similar size could not be identified.

Pattern recognition strategies for molecular surfaces. II. Surface complementarity.

Fuzzy logic based algorithms for the quantitative treatment of complementarity of molecular surfaces are presented. Therein, the overlapping surface patches defined in article I 1 of this series are used. The identification of complementary surface patches can be considered as a first step for the solution of molecular docking problems. Standard technologies can then be used for further optimization of the resulting complex structures. The algorithms are applied to 33 biomolecular complexes. After the optimization with a downhill simplex method, for all these complexes one structure was found, which is in very good agreement with the experimental results.

Molecular Visualization in the Rational Drug Design Process

The visualization of molecular scenarios on an atomic level can help to interpret experimental and theoretical findings. This is demonstrated in this review article with the specific field of drug design. State-of-the-art visualization techniques are described and applied to the different stages of the rational design process. Numerous examples from the literature, in which visualization was used as a major tool in the data analysis and interpretation, are provided to show that images are not only useful for drawing the attention of the reader to a specific paper in a scientific journal.

New Fuzzy Logic Strategies for Bio-molecular Recognition

The concepts of molecular similarity and molecular complementarity, playing important roles in the broad field of molecular recognition, are chemical problems, in which the eyeball technique used by a human observer is very successful but which are very hard to code into a computer algorithm. Based on the model of molecular surfaces, our new approach defines overlapping surface patches with similar molecular properties. These patches are used to represent local features of the molecule in a way, which is beyond the atomistic resolution but can nevertheless be applied in partial similarity as well as complementarity analyses in a very general sense. It is shown that this molecular description can be used as the first step in a docking algorithm for complexes, where the structures of both molecules are known, as well as for the identification of possible active sites without the knowledge of specific molecules binding to this site.