Conformational Boosting

2006 ◽  
Vol 59 (12) ◽  
pp. 874 ◽  
Author(s):  
Dimitris K. Agrafiotis ◽  
Alan Gibbs ◽  
Fangqiang Zhu ◽  
Sergei Izrailev ◽  
Eric Martin

Stochastic proximity embedding (SPE) is a novel self-organizing algorithm for sampling conformational space using geometric constraints derived from the molecular connectivity table. Here, we describe a simple heuristic that can be used in conjunction with SPE to bias the conformational search towards more extended or compact conformations, and thus greatly expand the range of geometries sampled during the search. The method uses a boosting strategy to generate a series of conformations, each of which is at least as extended (or compact) as the previous one. The approach is compared to several popular conformational sampling techniques using a reference set of 59 bioactive ligands extracted from the Protein Data Bank, and is shown to be significantly more effective in sampling the full range of molecular radii, with the exception of the Catalyst program, which was equally effective.

2018 ◽  
Vol 19 (11) ◽  
pp. 3405 ◽  
Author(s):  
Emanuel Peter ◽  
Jiří Černý

In this article, we present a method for the enhanced molecular dynamics simulation of protein and DNA systems called potential of mean force (PMF)-enriched sampling. The method uses partitions derived from the potentials of mean force, which we determined from DNA and protein structures in the Protein Data Bank (PDB). We define a partition function from a set of PDB-derived PMFs, which efficiently compensates for the error introduced by the assumption of a homogeneous partition function from the PDB datasets. The bias based on the PDB-derived partitions is added in the form of a hybrid Hamiltonian using a renormalization method, which adds the PMF-enriched gradient to the system depending on a linear weighting factor and the underlying force field. We validated the method using simulations of dialanine, the folding of TrpCage, and the conformational sampling of the Dickerson–Drew DNA dodecamer. Our results show the potential for the PMF-enriched simulation technique to enrich the conformational space of biomolecules along their order parameters, while we also observe a considerable speed increase in the sampling by factors ranging from 13.1 to 82. The novel method can effectively be combined with enhanced sampling or coarse-graining methods to enrich conformational sampling with a partition derived from the PDB.


Polymers ◽  
2020 ◽  
Vol 13 (1) ◽  
pp. 99
Author(s):  
Cristian Privat ◽  
Sergio Madurga ◽  
Francesc Mas ◽  
Jaime Rubio-Martínez

Solvent pH is an important property that defines the protonation state of the amino acids and, therefore, modulates the interactions and the conformational space of the biochemical systems. Generally, this thermodynamic variable is poorly considered in Molecular Dynamics (MD) simulations. Fortunately, this lack has been overcome by means of the Constant pH Molecular Dynamics (CPHMD) methods in the recent decades. Several studies have reported promising results from these approaches that include pH in simulations but focus on the prediction of the effective pKa of the amino acids. In this work, we want to shed some light on the CPHMD method and its implementation in the AMBER suitcase from a conformational point of view. To achieve this goal, we performed CPHMD and conventional MD (CMD) simulations of six protonatable amino acids in a blocked tripeptide structure to compare the conformational sampling and energy distributions of both methods. The results reveal strengths and weaknesses of the CPHMD method in the implementation of AMBER18 version. The change of the protonation state according to the chemical environment is presumably an improvement in the accuracy of the simulations. However, the simulations of the deprotonated forms are not consistent, which is related to an inaccurate assignment of the partial charges of the backbone atoms in the CPHMD residues. Therefore, we recommend the CPHMD methods of AMBER program but pointing out the need to compare structural properties with experimental data to bring reliability to the conformational sampling of the simulations.


2013 ◽  
Vol 48 ◽  
pp. 953-1000 ◽  
Author(s):  
F. Campeotto ◽  
A. Dal Palù ◽  
A. Dovier ◽  
F. Fioretto ◽  
E. Pontelli

This paper proposes the formalization and implementation of a novel class of constraints aimed at modeling problems related to placement of multi-body systems in the 3-dimensional space. Each multi-body is a system composed of body elements, connected by joint relationships and constrained by geometric properties. The emphasis of this investigation is the use of multi-body systems to model native conformations of protein structures---where each body represents an entity of the protein (e.g., an amino acid, a small peptide) and the geometric constraints are related to the spatial properties of the composing atoms. The paper explores the use of the proposed class of constraints to support a variety of different structural analysis of proteins, such as loop modeling and structure prediction. The declarative nature of a constraint-based encoding provides elaboration tolerance and the ability to make use of any additional knowledge in the analysis studies. The filtering capabilities of the proposed constraints also allow to control the number of representative solutions that are withdrawn from the conformational space of the protein, by means of criteria driven by uniform distribution sampling principles. In this scenario it is possible to select the desired degree of precision and/or number of solutions. The filtering component automatically excludes configurations that violate the spatial and geometric properties of the composing multi-body system. The paper illustrates the implementation of a constraint solver based on the multi-body perspective and its empirical evaluation on protein structure analysis problems.


Author(s):  
Ralf W. Grosse-Kunstleve ◽  
Nigel W. Moriarty ◽  
Paul D. Adams

Crystallographic methods using experimental diffraction data have produced about 85% of the macromolecular structures in the Protein Data Bank. Before deposition, nearly all crystal structures are refined with gradient-driven optimization techniques. Refinement is typically performed with iterative local optimization methods. A common problem is convergence to local minima. Reparameterization of the model in torsion angle space reduces the number of parameters. This in itself can help to escape from local minima. Combination with rigid-body dynamics algorithms results in an important tool for sampling conformational space. This paper presents the torsion angle refinement and dynamics algorithms implemented for the phenix.refine program and the results of various tests.


2016 ◽  
Vol 72 (9) ◽  
pp. 1006-1016 ◽  
Author(s):  
Tristan Ian Croll ◽  
Gregers Rom Andersen

While the rapid proliferation of high-resolution structures in the Protein Data Bank provides a rich set of templates for starting models, it remains the case that a great many structures both past and present are built at least in part by hand-threading through low-resolution and/or weak electron density. With current model-building tools this task can be challenging, and thede factostandard for acceptable error rates (in the form of atomic clashes and unfavourable backbone and side-chain conformations) in structures based on data withdmaxnot exceeding 3.5 Å reflects this. When combined with other factors such as model bias, these residual errors can conspire to make more serious errors in the protein fold difficult or impossible to detect. The three recently published 3.6–4.2 Å resolution structures of complement C4 (PDB entries 4fxg, 4fxk and 4xam) rank in the top quartile of structures of comparable resolution both in terms ofRfreeandMolProbityscore, yet, as shown here, contain register errors in six β-strands. By applying a molecular-dynamics force field that explicitly models interatomic forces and hence excludes most physically impossible conformations, the recently developed interactive molecular-dynamics flexible fitting (iMDFF) approach significantly reduces the complexity of the conformational space to be searched during manual rebuilding. This substantially improves the rate of detection and correction of register errors, and allows user-guided model building in maps with a resolution lower than 3.5 Å to converge to solutions with a stereochemical quality comparable to atomic resolution structures. Here, iMDFF has been used to individually correct and re-refine these three structures toMolProbityscores of <1.7, and strategies for working with such challenging data sets are suggested. Notably, the improved model allowed the resolution for complement C4b to be extended from 4.2 to 3.5 Å as demonstrated by paired refinement.


2011 ◽  
Vol 09 (03) ◽  
pp. 383-398 ◽  
Author(s):  
BRIAN OLSON ◽  
KEVIN MOLLOY ◽  
AMARDA SHEHU

The three-dimensional structure of a protein is a key determinant of its biological function. Given the cost and time required to acquire this structure through experimental means, computational models are necessary to complement wet-lab efforts. Many computational techniques exist for navigating the high-dimensional protein conformational search space, which is explored for low-energy conformations that comprise a protein's native states. This work proposes two strategies to enhance the sampling of conformations near the native state. An enhanced fragment library with greater structural diversity is used to expand the search space in the context of fragment-based assembly. To manage the increased complexity of the search space, only a representative subset of the sampled conformations is retained to further guide the search towards the native state. Our results make the case that these two strategies greatly enhance the sampling of the conformational space near the native state. A detailed comparative analysis shows that our approach performs as well as state-of-the-art ab initio structure prediction protocols.


2021 ◽  
Author(s):  
Qiyuan Zhao ◽  
Hsuan-Hao Hsu ◽  
Brett Savoie

Transition state searches are the basis for characterizing reaction mechanisms and activation energies, and are thus central to myriad chemical applications. Nevertheless, common search algorithms are sensitive to molecular conformation and the conformational space of even medium-sized reacting systems are too complex to explore with brute force. Here we show that it is possible to train a classifier to learn the features of conformers that conduce successful transition state searches, such that optimal conformers can be down-selected before incurring the cost of a high-level transition state search. To this end, we have benchmarked the use of a modern conformational generation algorithm with our reaction prediction methodology, Yet Another Reaction Program (YARP), for reaction prediction tasks. We demonstrate that neglecting conformer contributions leads to qualitatively incorrect activation energy estimations for a broad range of reactions, whereas a simple random forest classifier can be used to reliably down-select low-barrier conformers. We also compare the relative advantage of performing conformational sampling on reactant, product, and putative transition state geometries. The robust performance of this relatively simple machine learning classifier mitigates cost as a factor when implementing conformational sampling into contemporary reaction prediction workflows.


2021 ◽  
Author(s):  
Benjamin D. Hoffmann ◽  
Magen Pettit

ABSTRACTBecause different sampling techniques will provide different abundance values, it is currently difficult to compare results among many studies to form holistic understandings of how abundance influences ant ecology. Using three sampling methods in the same location we found pitfall traps best confirmed A. gracilipes presence recording the fewest zero values (9.1%), card counts were the least reliable (67.1%), and tuna lures were intermediate (30.1%). The abundance of A. gracilipes from card counts ranged from 0 to 20, in pitfall traps from 0 to 325, and the full range of tuna lure abundance scores (0-7) were sampled. We then determined the relationships between these three standard ant sampling techniques for the abundance of yellow crazy ant Anoplolepis gracilipes. Irrespective of the data transformation method, the strongest relationship was between pitfall traps and tuna lures, and the least strong was between pitfall traps and card counts. We then demonstrate the utility of this knowledge by analysing A. gracilipes abundance reported within published literature to show where the populations in those studies sit on an abundance spectrum. We also comment on insights into the relative utility of the three methods we used to determine A. gracilipes abundance among populations of varying abundance. Pitfall traps was the most reliable method to determine if the species was present at the sample level. Tuna lures were predominantly reliable for quantifying the presence of workers, but were limited by the number of workers that can gather around a spoonful of tuna. Card counts were the quickest method, but were seemingly only useful when A. gracilipes abundance is not low. Finally we discuss how environmental and biological variation needs to be accounted for in future studies to better standardise sampling protocols to help progress ecology as a precision science.


2014 ◽  
Vol 20 (20) ◽  
pp. 3303-3313 ◽  
Author(s):  
Marcus Hatfield ◽  
Sandor Lovas

Sign in / Sign up

Export Citation Format

Share Document