Search PubMed⌕ Search

Biomedical subjects

P Willett

Publications and source records attributed to P Willett.

At least 37 records · Page 2Linked to original sources

SLASH: a program for analysing the functional groups in molecules.

The program SLASH, which is designed to enable large numbers of compounds to be analysed in terms of the functional groups they contain, is described. The usefulness of the groups for analysing the activities of compounds tested in high-throughput biological screens is investigated. The functional group fragments are also studied as a means of determining similarity within groups of compounds.

Drug Design↗

Representation and searching of carbohydrate structures using graph-theoretic techniques.

This paper describes how the carbohydrate structures in the Complex Carbohydrate Structure Database (CCSD) can be represented by labelled graphs, in which the nodes and edges of a graph are used to denote the residues and the inter-residue linkages, respectively, of a carbohydrate. These graph representations are then searched with a subgraph-isomorphism algorithm. We describe the use of one such algorithm, that due to Ullmann, and demonstrate that it provides a very precise way of searching the structures in CCSD. We also describe the use of screening techniques that can eliminate many of the CCSD structures from the subgraph-isomorphism search, with a consequent increase in the speed of the search.

Algorithms↗

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.

Algorithms↗

Using a genetic algorithm to identify common structural features in sets of ligands.

This article describes a program for pharmacophore mapping, called MPHIL (Mapping Pharmacophores in Ligands). Given as input a set of molecules that exhibit some common biological activity, MPHIL identifies the smallest 3D pattern of pharmacophore points that has at least m (a user-defined parameter) points in common with each of the input molecules. The program thus differs from existing programs for pharmacophore mapping in that it does not require all of the molecules to share exactly the same pattern of points, although it will find such a common pattern if it does, indeed, exist. MPHIL uses a genetic algorithm (GA) approach in which an initial, and very rapid, GA is used to suggest possible combinations of points that are then processed by the second GA to yield the final 3D pattern.

Algorithms↗

Clique-detection algorithms for matching three-dimensional molecular structures.

The representation of chemical and biological molecules by means of graphs permits the use of a maximum common subgraph (MCS) isomorphism algorithm to identify the structural relationships existing between pairs of such molecular graphs. Clique detection provides an efficient way of implementing MCS detection, and this article reports a comparison of several different clique-detection algorithms when used for this purpose. Experiments with both small molecules and proteins demonstrate that the most efficient of these particular applications, which typically involve correspondence graphs with low edge densities, is the algorithm described by Carraghan and Pardalos. This is shown to be two to three times faster than the Bron-Kerbosch algorithm that has been used previously for MCS applications in chemistry and biology. However, the latter algorithm enables all substructures common to a pair of molecules to be identified, and not just the largest ones, as with the other algorithms considered here. The two algorithms can usefully be combined to increase the efficiency of database-searching systems that use the MCS as a measure of structural similarity.

Algorithms↗

Comparison of algorithms for dissimilarity-based compound selection.

Dissimilarity-based compound selection has been suggested as an effective method for selecting structurally diverse subsets of chemical databases. This article reports a comparison of several maximum-dissimilarity and sphere-exclusion algorithms for dissimilarity-based selection. The effectiveness of the algorithms is quantified by the numbers of biological activity classes identified in subsets selected from the World Drugs Index database, and by the numbers of active compounds identified in feedback searches of this database. The experiments demonstrate the general effectiveness and efficiency of the MaxMin algorithm.

Algorithms↗

Comparison of protein surfaces using a genetic algorithm.

A genetic algorithm (GA) is described which is used to compare the solvent-accessible surfaces of two proteins or fragments of proteins, represented by a dot surface calculated using the Connolly algorithm. The GA is used to move one surface relative to the other to locate the most similar surface region between the two. The matching process is enhanced by the use of the surface normals and shape terms provided by the Connolly program and also by a simple hydrogen-bonding descriptor and an additional shape descriptor. The algorithm has been tested in applications ranging from the comparison of small surface patches to the comparison of whole protein surfaces, and it has performed correctly in all cases. Examples of the matches are given and a quantitative analysis of the quality of the matches is performed. A number of possible future enhancements to the program are described which would allow the GA to be used for more complex surface comparisons.

Alcohol Dehydrogenase↗

Evaluation of a novel infrared range vibration-based descriptor (EVA) for QSAR studies. 1. General application.

A novel molecular descriptor (EVA) based upon calculated infrared range vibrational frequencies is evaluated for use in QSAR studies. The descriptor is invariant to both translation and rotation of the structures concerned. The method was applied to 11 QSAR datasets exhibiting both a range of biological endpoints and various degrees of structural diversity. This study demonstrates that robust QSAR models can be obtained using the EVA descriptor and examines the effect of EVA parameter changes on these models; recommendations are made as to the appropriate choice of parameters. The performance of EVA was found to be comparable in statistical terms to that of CoMFA, despite the fact that EVA does not require the generation of a structural alignment. Models derived using semiempirical (MOPAC AM1 and PM3) and AMBER mechanics calculated normal mode frequencies are compared, with the overall conclusion that the semiempirical methods perform equally well and both outperform the AMBER-based models.

Computer Simulation↗

Similarity searching in files of three-dimensional chemical structures: representation and searching of molecular electrostatic potentials using field-graphs.

This paper reports a method for the identification of those molecules in a database of rigid 3d structures with molecular electrostatic potential (MEP) grids that are most similar to that of a user-defined target molecule. The most important features of an MEP grid are encoded in field-graphs, and a target molecule is matched against a database molecule by a comparison of the corresponding field-graphs. The matching is effected using a maximal common subgraph isomorphism algorithm, which provides an alignment of the target molecule's field-graph with those of each of the database molecules in turn. These alignments are used in the second stage of the search algorithm to calculate the intermolecular MEP similarities. Several different ways of generating field-graphs are evaluated, in terms of the effectiveness of the resulting similarity measures and of the associated computational costs. The most appropriate procedure has been implemented in an operational system that searches a corporate database, containing ca. 173,000 3D structures.

Algorithms↗

Biotin carboxylase comes into the fold.

Extensive three-dimensional structural resemblances between biotin carboxylase and the ADP-forming peptide synthetases, represented by glutathione synthetase and D-Ala:D-Ala ligase, reveal a previously unsuspected evolutionary relationship between two major families of ADP-forming ligases.

Amino Acid Sequence↗

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

Understanding the principles whereby macromolecular biological receptors can recognise small molecule substrates or inhibitors is the subject of a major effort. This is of paramount importance in rational drug design where the receptor structure is known (the "docking" problem). Current theoretical approaches utilise models of the steric and electrostatic interaction of bound ligands and recently conformational flexibility has been incorporated. We report results based on software using a genetic algorithm that uses an evolutionary strategy in exploring the full conformational flexibility of the ligand with partial flexibility of the protein, and which satisfies the fundamental requirement that the ligand must displace loosely bound water on binding. Results are reported on five test systems showing excellent agreement with experimental data. The design of the algorithm offers insight into the molecular recognition mechanism.

Arabinose↗

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.

Algorithms↗

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.

Algorithms↗

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.

Algorithms↗

A graph-theoretic approach to the identification of three-dimensional patterns of amino acid side-chains in protein structures.

This paper discusses the use of graph-theoretic methods for the representation and searching of three-dimensional patterns of side-chains in protein structures. The position of a side-chain is represented by pseudo-atoms, and the relative positions of pairs of side-chains by the distances between them. This description of the geometry can be represented by a labelled graph in which the nodes and the edges of the graph represent the pseudo-atoms and the sets of inter-pseudo-atomic distances, respectively. Given such a representation, a protein can be searched for the presence of a user-defined query pattern of side-chains by means of a subgraph-isomorphism algorithm which is implemented in the program ASSAM. Experiments with one such algorithm, that due to Ullmann, show that it provides both an effective and a highly efficient way of searching for patterns of side-chains. The method is illustrated by searches for the serine protease catalytic triad, for residues involved in the catalytic activity of staphyloccocal nuclease, and for the zinc-binding side-chains of thermolysin. The catalytic triad pattern search revealed the existence of a second Asp-His-Ser triad-like arrangement of residues in trypsinogen and chymotrypsinogen, in addition to the catalytic residues. In addition the program can be used to search for hypothetical patterns, as is shown for a pattern of three tryptophan side-chains. These searches demonstrate that the search algorithm can successfully retrieve the great majority of the expected proteins, as well as other, previously unreported proteins that contain the pattern of interest.

Algorithms↗

Structural similarity between binding sites in influenza sialidase and isocitrate dehydrogenase: implications for an alternative approach to rational drug design.

Using searching techniques based on algorithms derived from graph theory, we have established a similarity between a 3-dimensional cluster of side chains implicated in drug binding in influenza sialidase and side chains involved in isocitrate binding in Escherichia coli isocitrate dehydrogenase. The possible implications of the use of such comparative methods in drug design are discussed.

Algorithms↗