Search PubMed⌕ Search

Biomedical subjects

A R Leach

Publications and source records attributed to A R Leach.

At least 19 recordsLinked to original sources

Binding constants of neuraminidase inhibitors: An investigation of the linear interaction energy method.

The linear interaction energy (LIE) method has been applied to the calculation of the binding free energies of 15 inhibitors of the enzyme neuraminidase. This is a particularly challenging system for this methodology since the protein conformation and the number of tightly bound water molecules in the active site are known to change for different inhibitors. It is not clear that the basic LIE method will calculate the contributions to the binding free energies arising from these effects correctly. Application of the basic LIE equation yielded an rms error with respect to experiment of 1.51 kcal mol(-1) for the free energies of binding. To determine whether it is appropriate to include extra terms in the LIE equation, a detailed statistical analysis was undertaken. Multiple linear regression (MLR) is often used to determine the significance of terms in a fitting equation; this method is inappropriate for the current system owing to the highly correlated nature of the descriptor variables. Use of MLR in other applications of the LIE equation is therefore not recommended without a correlation analysis being performed first. Here factor analysis was used to determine the number of useful dimensions contained within the data and, hence, the maximum number of variables to be considered when specifying a model or equation. Biased fitting methods using orthogonalized components were then used to generate the most predictive model. The final model gave a q(2) of 0.74 and contained van der Waals and electrostatic energy terms. This result was obtained without recourse to prior knowledge and was based solely on the information content of the data.

Crystallography, X-Ray↗

Ligand solvation in molecular docking.

Solvation plays an important role in ligand-protein association and has a strong impact on comparisons of binding energies for dissimilar molecules. When databases of such molecules are screened for complementarity to receptors of known structure, as often occurs in structure-based inhibitor discovery, failure to consider ligand solvation often leads to putative ligands that are too highly charged or too large. To correct for the different charge states and sizes of the ligands, we calculated electrostatic and non-polar solvation free energies for molecules in a widely used molecular database, the Available Chemicals Directory (ACD). A modified Born equation treatment was used to calculate the electrostatic component of ligand solvation. The non-polar component of ligand solvation was calculated based on the surface area of the ligand and parameters derived from the hydration energies of apolar ligands. These solvation energies were subtracted from the ligand-receptor interaction energies. We tested the usefulness of these corrections by screening the ACD for molecules that complemented three proteins of known structure, using a molecular docking program. Correcting for ligand solvation improved the rankings of known ligands and discriminated against molecules with inappropriate charge states and sizes.

Aniline Compounds↗

Exploring the conformational space of protein side chains using dead-end elimination and the A* algorithm.

We describe an algorithm which enables us to search the conformational space of the side chains of a protein to identify the global minimum energy combination of side chain conformations as well as all other conformations within a specified energy cutoff of the global energy minimum. The program is used to explore the side chain conformational energy surface of a number of proteins, to investigate how this surface varies with the energy model used to describe the interactions within the system and the rotamer library. Enumeration of the rotamer combinations enables us to directly evaluate the partition function, and thus calculate the side chain contribution to the conformational entropy of the folded protein. An investigation of these conformations and the relationships between them shows that most of the conformations near to the global energy minimum arise from changes in side chain conformations that are essentially independent; very few result from a concerted change in conformation of two or more residues. Some of the limitations of the approach are discussed.

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↗

Structure-based selection of building blocks for array synthesis via the World-Wide Web.

In this article we are concerned with the selection of chemical entities for array synthesis in a structure-based design project. We have extended our conformational searching algorithm to permit the enumeration of a set of substituents at a particular position for a fixed template. The conformational space of each of the resulting structures is then explored within the confines of the binding site to identify conformations that do not interact unfavorably with the surrounding protein. The template remains fixed in its original orientation within the binding site. The interaction between each conformation and the binding site can also be quantified using various calculated properties. Each substituent for which one or more acceptable conformations can be found is retained for further analysis. Use of the program is facilitated by a Web-based interface that enables nonexpert molecular modelers to perform searches, view the results in a platform-independent manner (via VRML), and perform simple cluster analysis on the resulting sets of molecules. The approach is illustrated using a series of penicillin-based HIV-1 protease inhibitors.

Algorithms↗

The aggregation behaviour of two structurally isomeric glycolipids.

The two structurally isomeric glycolipids N-octyl-(1-hexadecylamido)-beta-D-glucopyranoside (Glc-N-[8/16]) and N-hexadecyl-(1-octylamido)-beta-D-glucopyranoside (Glc-N[16/8]) were synthesized. The lyotropic phase behaviour of these isomers was investigated in order to determine the extent to which the relative disposition of the alkyl chains with respect to the amide unit affects the aggregation properties of the amphiphiles. Both isomers exhibit lamellar and inverse topology cubic mesophases. The extent and polymorphism of the non-lamellar phases appear to be more pronounced in the Glc-N-[8/16] isomer relative to the Glc-N-[16/8] isomer. A molecular mechanics study was undertaken in an attempt to rationalize this behaviour.

Carbohydrate Sequence↗

Ligand docking to proteins with discrete side-chain flexibility.

An algorithm is described that explores the conformational degrees of freedom of the amino acid side-chains and of the ligand when docking a putative ligand into a receptor site. For a given orientation of the ligand relative to the protein, the method can find the lowest energy combination of amino acid side-chains and ligand conformations as well as all other combinations in order of increasing energy within a specified energy cutoff. The amino acid side-chains and the ligand are restricted to discrete low-energy conformations, determined for the former by analysing high-resolution protein structures and in the latter case from a conformational analysis. Coupled to an algorithm for exploring the six degrees of orientational freedom of the ligand with respect to the receptor, the method can be used to perform conformationally flexible ligand docking. A combination of two search methods is employed to explore the conformational degrees of freedom: Dead End Elimination and the A* algorithm. When no ligand is present the approach can be used to predict the lowest energy combinations of side-chain conformations for a given protein backbone structure. The approach is employed to illustrate how such a procedure can be used to estimate the conformational entropy change that accompanies the formation of an intermolecular complex between a protein and a ligand and to demonstrate that the protein's conformational entropy may in some cases increase on binding the ligand. This is due to a modification of the protein's energy hypersurface that makes more conformational states accessible. Our results highlight the need for appropriate methods to estimate the strength of binding.

Algorithms↗

Current methods for site-directed structure generation.

There has been a rapid growth of interest in techniques for site-directed drug design, fueled by the increasing availability of structural models of proteins of therapeutic importance, and by studies reported in the literature showing that potent chemical leads can be obtained by these techniques. Structure generation programs offer the prospect of discovering highly original lead structures from novel chemical families. Due to the fact that this technique is more-or-less still in its infancy, there are no case studies available that demonstrate the use of structure generation programs for site-directed drug design. Such programs were first proposed in 1986, and became commercially available in early 1992. They have shown their ability to reproduce, or suggest reasonable alternatives for, ligands in well-defined binding sites. This brief review will discuss the recent advances that have been made in the field of site-directed structure generation.

Algorithms↗

Automated molecular design: a new fragment-joining algorithm.

A popular first step in the problem of structure-based, 'de novo' molecule design is to identify regions where specific functional groups or chemical entities would be expected to interact strongly. When the three-dimensional structure of the receptor is not available, it may be possible to derive a pharmacophore giving the three-dimensional relationships between such chemical groups. The task then is to design synthetically feasible molecules which not only contain the required groups, but which can also position them in the desired relative orientation. One way to do this is to first link the groups using an acyclic chain. We have investigated the application of the 'tweak' algorithm [Shenkin, P.S. et al., Biopolymers, 26 (1987) 2053] for generating families of acyclic linkers. These linking structures can subsequently be 'braced' using a ring-joining algorithm [Leach, A.R. and Lewis, R.A., J. Comput. Chem., 15 (1994) 233], giving rise to an even wider variety of molecular skeletons for further studies.

Algorithms↗

Constitutional, configurational and conformational analysis of transition metal coordination complexes.

A computational approach to conformational analysis is applied to the study of transition metal coordination complexes. The method provides a means of rapidly exploring conformational space without any inherent reliance on energy calculations and is therefore applicable to a wide variety of systems. It has been incorporated into an algorithm which explores the constitutional, configurational and conformational degrees of freedom for a metal ion and a number of potential ligands. The program determines which of the possible coordination complex products could form stable conformations and can therefore be used to rationalise the products obtained from the mixture. The method is illustrated using two cases: the cobalt(III)-triethylenetetramine-glycine system and complexes of diindolopyridine derivatives.

Algorithms↗

Enantioselective N-oxygenation of chlorpheniramine by the flavin-containing monooxygenase from hog liver.

1. The metabolism of racemic, (D)- and (L)-chlorpheniramine, a widely used antihistamine, was studied in microsomes and with highly purified flavin-containing monooxygenase from hog liver. 2. Although some N-demethylation was observed, the major metabolite of chlorpheniramine in hog liver microsomes was the aliphatic nitrogen N-oxide. Chlorpheniramine was extensively N-oxygenated by the highly purified flavin-containing monooxygenase from hog liver. 3. N-Oxygenation of chlorpheniramine in both microsomes and highly purified flavin-containing monooxygenase from hog liver was enantioselective. The Km for (D)-chlorpheniramine N-oxygenation was markedly lower than that for (L)-chlorpheniramine. 4. Molecular modelling studies were performed to investigate the nature of the substrate binding region.

Animals↗

Automated conformational analysis: algorithms for the efficient construction of low-energy conformations.

The method of constructing low-energy conformations using template joining can provide an efficient means of searching the conformational space of molecules. The simplest algorithm to perform this task would construct each potential conformation from scratch. However, new algorithms, some of which use techniques from Artificial Intelligence, have been developed which can greatly improve the efficiency of this approach.

Algorithms↗

Automated conformational analysis and structure generation: algorithms for molecular perception.

Many methodologies for performing automated conformational analysis require some means of "perceiving" a molecule to determine features of interest. Algorithms for finding rings, bond orders, and stereocenters and detecting the presence of substructural fragments have been developed. These algorithms are described, emphasizing their importance in conformational analysis.

Artificial Intelligence↗

WIZARD: AI in conformational analysis.

A program which utilizes the techniques of Artificial Intelligence and Expert Systems to solve problems in the area of Conformational Analysis is described. The program searches conformational space in a systematic fashion, based on the technique known as heuristic state-space search. The program proceeds by recognizing conformational units, assigning one or more conformational templates to each unit, and joining them to form conformational suggestions. These suggestions are criticized to discover logical inconsistencies, and any resulting stresses are resolved. The resulting conformational suggestions are sometimes accurate enough for immediate use, or may be further refined by a numerical program. The latter combination is shown to be quite efficient compared to purely numerical conformational search techniques.

Artificial Intelligence↗

Synergy between combinatorial chemistry and de novo design.

Traditional de novo design algorithms are able to generate many thousands of ligand structures that meet the constraints of a protein structure, but these structures are often not synthetically tractable. In this article, we describe how concepts from structure-based de novo design can be used to explore the search space in library design. A key feature of the approach is the requirement that specific templates are included within the designed structures. Each template corresponds to the "central core" of a combinatorial library. The template is positioned within an acyclic chain whose length and bond orders are systematically varied, and the conformational space of each structure that results (core plus chain) is explored to determine whether it is able to link together two or more strongly interacting functional groups or pharmacophores located within a protein binding site. This fragment connection algorithm provides "generic" 3D molecules in the sense that the linking part (minus the template) is built from an all-carbon chain whose synthesis may not be easily achieved. Thus, in the second phase, 2D queries are derived from the molecular skeletons and used to identify possible reagents from a database. Each potential reagent is checked to ensure that it is compatible with the conformation of its parent 3D conformation and the constraints of the binding site. Combinations of these reagents according to the combinatorial library reaction scheme give product molecules that contain the desired core template and the key functional/pharmacophoric groups, and would be able to adopt a conformation compatible with the original molecular skeleton without any unfavorable intermolecular or intramolecular interactions. We discuss how this strategy compares with and relates to alternative approaches to both structure-based library design and de novo design.

Algorithms↗

Where are the GaPs? A rational approach to monomer acquisition and selection.

Gridding and partitioning (GaP) is a computational method for the classification and selection of monomers for combinatorial libraries. The molecules are described in terms of the pharmacophoric groups they contain and where those pharmacophoric groups can be located in three-dimensional space. The approach involves a detailed conformational analysis of each molecule. This conformational analysis is done within a common coordinate frame, thus enabling the monomers to be compared. The use of a partitioned space is central to this particular application as it facilitates the identification of regions of space which are not well represented by existing compounds. Several ways to extend the use of partitioned pharmacophore spaces are described. Applications of the approach in monomer acquisition and in library design are outlined.

Algorithms↗

PLUMS: a program for the rapid optimization of focused libraries.

PLUMS is a new method to perform rational monomer selection for combinatorial chemistry libraries. The algorithm has been developed to optimize focused libraries with specific two-dimensional and/or three-dimensional properties. A preliminary step is the identification of those molecules in the initial virtual library which satisfy the imposed property constraints; we define these molecules as the virtual hits. From the virtual hits, PLUMS generates a starting library, which is the true combinatorial library that includes all the virtual hits. Monomers are then removed in an iterative fashion, thus reducing the size of the library. At each iteration, the worst monomer is removed. Each sublibrary is selected using a global scoring function, which balances effectiveness and efficiency. The iterative process continues until one is left with a library that consists entirely of virtual hits. The optimal library, which is the best compromise between effectiveness and efficiency, can then be selected according to the score. During the iterative process, equivalent solutions may well occur and are taken into account by the algorithm, according to a user-defined parameter. The number of monomers for each substitution site and the size of the library are parameters that can be either optimized or used to constrain the selection. The results obtained on two test libraries are presented. PLUMS was compared with genetic algorithms (GA) and monomer frequency analysis (MFA), which are widely used for monomer selection. For the two test libraries, PLUMS and GA gave equivalent results. MFA is the fastest method, but it can give misleading solutions. Possible advantages and disadvantages of the different methods are discussed.

Journal Article↗