Empirical solvation models in the context of conformational energy searches: application to bovine pancreatic trypsin inhibitor.

Continuum solvation models that estimate free energies of solvation as a function of solvent accessible surface area are computationally simple enough to be useful for predicting protein conformation. The behavior of three such solvation models has been examined by applying them to the minimization of the conformational energy of bovine pancreatic trypsin inhibitor. The models differ only with regard to how the constants of proportionality between free energy and surface area were derived. Each model was derived by fitting to experimentally measured equilibrium solution properties. For two models, the solution property was free energy of hydration. For the third, the property was NMR coupling constants. The purpose of this study is to determine the effect of applying these solvation models to the nonequilibrium conformations of a protein arising in the course of global searches for conformational energy minima. Two approaches were used: (1) local energy minimization of an ensemble of conformations similar to the equilibrium conformation and (2) global search trajectories using Monte Carlo plus minimization starting from a single conformation similar to the equilibrium conformation. For the two models derived from free energy measurements, it was found that both the global searches and local minimizations yielded conformations more similar to the X-ray crystallographic structures than did searches or local minimizations carried out in the absence of a solvation component of the conformational energy. The model derived from NMR coupling constants behaved similarly to the other models in the context of a global search trajectory. For one of the models derived from measured free energies of hydration, it was found that minimization of an ensemble of near-equilibrium conformations yielded a new ensemble in which the conformation most similar to the X-ray determined structure PTI4 had the lowest total free energy. Despite the simplicity of the continuum solvation models, the final conformation generated in the trajectories for each of the models exhibited some of the characteristics that have been reported for conformations obtained from molecular dynamics simulations in the presence of a bath of explicit water molecules. They have smaller root mean square (rms) deviations from the experimentally determined conformation, fewer incorrect hydrogen bonds, and slightly larger radii of gyration than do conformations derived from search trajectories carried out in the absence of solvent.     

Discrimination of near-native structures in protein-protein docking by testing the stability of local minima

Fast Fourier transform (FFT) correlation methods of protein-protein docking, combined with the clustering of low energy conformations, can find a number of local minima on the energy surface. For most complexes, the locations of the near-native structures can be constrained to the 30 largest clusters, each surrounding a local minimum. However, no reliable further discrimination can be obtained by energy measures because the differences in the energy levels between the minima are comparable with the errors in the energy evaluation. In fact, no current scoring function accounts for the entropic contributions that relate to the width rather than the depth of the minima. Since structures at narrow minima loose more entropy, some of the nonnative states can be detected by determining whether or not a local minimum is surrounded by a broad region of attraction on the energy surface. The analysis is based on starting Monte Carlo Minimization (MCM) runs from random points around each minimum, and observing whether a certain fraction of trajectories converge to a small region within the cluster. The cluster is considered stable if such a strong attractor exists, has at least 10 convergent trajectories, is relatively close to the original cluster center, and contains a low energy structure. We studied the stability of clusters for enzyme-inhibitor and antibody-antigen complexes in the Protein Docking Benchmark. The analysis yields three main results. First, all clusters that are close to the native structure are stable. Second, restricting considerations to stable clusters eliminates around half of the false positives, that is, solutions that are low in energy but far from the native structure of the complex. Third, dividing the conformational space into clusters and determining the stability of each cluster, the combined approach is less dependent on a priori information than exploring the potential conformational space by Monte Carlo minimizations.     

Fast and accurate fitting of relaxation dispersion data using the flexible software package GLOVE

Relaxation dispersion spectroscopy is one of the most widely used techniques for the analysis of protein dynamics. To obtain a detailed understanding of the protein function from the view point of dynamics, it is essential to fit relaxation dispersion data accurately. The grid search method is commonly used for relaxation dispersion curve fits, but it does not always find the global minimum that provides the best-fit parameter set. Also, the fitting quality does not always improve with increase of the grid size although the computational time becomes longer. This is because relaxation dispersion curve fitting suffers from a local minimum problem, which is a general problem in non-linear least squares curve fitting. Therefore, in order to fit relaxation dispersion data rapidly and accurately, we developed a new fitting program called GLOVE that minimizes global and local parameters alternately, and incorporates a Monte-Carlo minimization method that enables fitting parameters to pass through local minima with low computational cost. GLOVE also implements a random search method, which sets up initial parameter values randomly within user-defined ranges. We demonstrate here that the combined use of the three methods can find the global minimum more rapidly and more accurately than grid search alone.     

Determining minimum energy conformations of polypeptides by dynamic programming

A combinatorial optimization approach is used for solving the multiple-minima problem when determining the low-energy conformations of short polypeptides. Each residue is represented by a finite number of discrete states corresponding to single residue local minima of the energy function. These precomputed values constitute a search table and define the conformational space for discrete minimization by a generalized dynamic programming algorithm that significantly limits the number of intermediate conformations to be generated during the search. Since dynamic programming involves stagewise decisions, it results in buildup-type procedures implemented in two different forms. The first procedure predicts a number of conformations by a completely discrete search and these are subsequently refined by local minimization. The second involves limited continuous local minimization within the combinatorial algorithm, generally restricted to two dihedral angles in a buildup step. Both procedures are tested on 17 short peptides previously studied by other global minimization methods but involving the same potential energy function. The discrete method is extremely fast, but proves to be successful only in 14 of the 17 test problems. The version with limited local minimization finds, however, conformations in all the 17 examples that are close to the ones previously presented in the literature or have lower energies. In addition, results are almost independent of the cutoff energy, the most important parameter governing the search. Although the limited local minimization increases the number of energy evaluations, the method still offers substantial advantages in speed.     

Energy minimization for tertiary structure prediction of homologous proteins: alpha 1-purothionin and viscotoxin A3 models from crambin

Homologous proteins may fold into similar three-dimensional structures. Spectroscopic evidence suggests this is true for the cereal grain thionins, the mistletoe toxins, and for crambin, three classes of plant proteins. We have combined primary sequence homology and energy minimization to predict the structures alpha 1-purothionin (from Durum wheat) and viscotoxin A3 (from Viscum album, European mistletoe) from the high resolution (0.945 A) crystal structure of crambin (from Crambe abyssinica). Our predictions will be verifiable because we have diffraction-quality crystals of alpha 1-purothionin whose structure we are have predicted. The potential energy minimizations for each protein were performed both with and without harmonic constraints to its initial backbone to explore the existence of local minima for the predicted proteins. Crambin was run as a control to examine the effects of the potential energy minimization on a protein with a well-known structure. Only alpha 1-purothionin which has one fewer residue in a turn region shows a significant difference for the two minimization paths. The results of these predictions suggest that alpha 1-purothionin and viscotoxin are amphipathic proteins, and this character may relate to the mechanism of action for these proteins. Both are mildly membrane-active and their amphipatic character is well suited for interaction with a lipid bilayer.     

基于秦岭样区的四种时序EVI函数拟合方法对比研究

函数曲线拟合方法是植被指数时间序列重建的一个重要方法,已经广泛应用于森林面积动态变化监测、农作物估产、遥感物候信息提取、生态系统碳循环研究等领域。基于秦岭样区多年MODIS EVI遥感数据及其质量控制数据,探讨并改进了时序EVI重建过程中噪声点优化和对原始高质量数据保真能力的评价方法;在此基础上,比较了常用的非对称性高斯函数拟合法(AG)、双Logistic函数拟合法(DL)和单Logistic函数拟合法(SL)。基于SL方法,调整了模型形式并重新定义d的参数意义,提出了最值优化单Logistic函数拟合法(MSL),并与其他3种方法进行对比。结果表明;在噪声点优化及保留原始高质量数据方面,AG方法和DL方法二者整体差别不大,而在部分像元的处理上AG方法表现出更好的拟合效果;MSL方法和SL方法相比于AG方法和DL方法其效果更为突出;在地形气候复杂,植被指数噪声较多的山区,MSL方法表现出更好的适用性。     

A century of enzyme kinetic analysis, 1913 to 2013

This review traces the history and logical progression of methods for quantitative analysis of enzyme kinetics from the 1913 Michaelis and Menten paper to the application of modern computational methods today. Following a brief review of methods for fitting steady state kinetic data, modern methods are highlighted for fitting full progress curve kinetics based upon numerical integration of rate equations, including a re-analysis of the original Michaelis–Menten full time course kinetic data. Finally, several illustrations of modern transient state kinetic methods of analysis are shown which enable the elucidation of reactions occurring at the active sites of enzymes in order to relate structure and function.     

Fold helical proteins by energy minimization in dihedral space and a DFIRE-based statistical energy function

Statistical energy functions are discrete (or stepwise) energy functions that lack van der Waals repulsion. As a result, they are often applied directly to a given structure (native or decoy) without further energy minimization being performed to the structure. However, the full benefit (or hidden defect) of an energy function cannot be revealed without energy minimization. This paper tests a recently developed, all-atom statistical energy function by energy minimization with a fixed secondary helical structure in dihedral space. This is accomplished by combining the statistical energy function based on a distance-scaled finite ideal-gas reference (DFIRE) state with a simple repulsive interaction and an improper torsion energy function. The energy function was used to minimize 2000 random initial structures of 41 small and medium-sized helical proteins in a dihedral space with a fixed helical region. Results indicate that near-native structures for most studied proteins can be obtained by minimization alone. The average minimum root-mean-squared distance (rmsd) from the native structure for all 41 proteins is 4.1 A. The energy function (together with a simple clustering of similar structures) also makes a reasonable selection of near-native structures from minimized structures. The average rmsd value and the average rank for the best structure in the top five is 6.8 A and 2.4, respectively. The accuracy of the structures sampled and the structure selections can be improved significantly with the removal of flexible terminal regions in rmsd calculations and in minimization and with the increase in the number of minimizations. The minimized structures form an excellent decoy set for testing other energy functions because most structures are well-packed with minimum hard-core overlaps with correct hydrophobic/hydrophilic partitioning. They are available online at http://theory.med.buffalo.edu.     

A novel approach to decoy set generation: designing a physical energy function having local minima with native structure characteristics

We suggest a new approach to the generation of candidate structures (decoys) for ab initio prediction of protein structures. Our method is based on random sampling of conformation space and subsequent local energy minimization. At the core of this approach lies the design of a novel type of energy function. This energy function has local minima with native structure characteristics and wide basins of attraction. The current work presents our motivation for deriving such an energy function and also tests the derived energy function.Our approach is novel in that it takes advantage of the inherently rough energy landscape of proteins, which is generally considered a major obstacle for protein structure prediction. When local minima have wide basins of attraction, the protein's conformation space can be greatly reduced by the convergence of large regions of the space into single points, namely the local minima corresponding to these funnels. We have implemented this concept by an iterative process. The potential is first used to generate decoy sets and then we study these sets of decoys to guide further development of the potential. A key feature of our potential is the use of cooperative multi-body interactions that mimic the role of the entropic and solvent contributions to the free energy.The validity and value of our approach is demonstrated by applying it to 14 diverse, small proteins. We show that, for these proteins, the size of conformation space is considerably reduced by the new energy function. In fact, the reduction is so substantial as to allow efficient conformational sampling. As a result we are able to find a significant number of near-native conformations in random searches performed with limited computational resources.     

A population-based evolutionary search approach to the multiple minima problem in de novo protein structure prediction

Background

Elucidating the native structure of a protein molecule from its sequence of amino acids, a problem known as de novo structure prediction, is a long standing challenge in computational structural biology. Difficulties in silico arise due to the high dimensionality of the protein conformational space and the ruggedness of the associated energy surface. The issue of multiple minima is a particularly troublesome hallmark of energy surfaces probed with current energy functions. In contrast to the true energy surface, these surfaces are weakly-funneled and rich in comparably deep minima populated by non-native structures. For this reason, many algorithms seek to be inclusive and obtain a broad view of the low-energy regions through an ensemble of low-energy (decoy) conformations. Conformational diversity in this ensemble is key to increasing the likelihood that the native structure has been captured.

Methods

We propose an evolutionary search approach to address the multiple-minima problem in decoy sampling for de novo structure prediction. Two population-based evolutionary search algorithms are presented that follow the basic approach of treating conformations as individuals in an evolving population. Coarse graining and molecular fragment replacement are used to efficiently obtain protein-like child conformations from parents. Potential energy is used both to bias parent selection and determine which subset of parents and children will be retained in the evolving population. The effect on the decoy ensemble of sampling minima directly is measured by additionally mapping a conformation to its nearest local minimum before considering it for retainment. The resulting memetic algorithm thus evolves not just a population of conformations but a population of local minima.

Results and conclusions

Results show that both algorithms are effective in terms of sampling conformations in proximity of the known native structure. The additional minimization is shown to be key to enhancing sampling capability and obtaining a diverse ensemble of decoy conformations, circumventing premature convergence to sub-optimal regions in the conformational space, and approaching the native structure with proximity that is comparable to state-of-the-art decoy sampling methods. The results are shown to be robust and valid when using two representative state-of-the-art coarse-grained energy functions.

     

Improved structural characterizations of the drkN SH3 domain unfolded state suggest a compact ensemble with native-like and non-native structure

Due to their dynamic ensemble nature and a deficiency of experimental restraints, disordered states of proteins are difficult to characterize structurally. Here, we have expanded upon our previous work on the unfolded state of the Drosophila drk N-terminal (drkN) SH3 domain with our program ENSEMBLE, which assigns population weights to pregenerated conformers in order to calculate ensembles of structures whose properties are collectively consistent with experimental measurements. The experimental restraint set has been enlarged with newly measured paramagnetic relaxation enhancements from Cu(2+) bound to an amino terminal Cu(2+)-Ni(2+) binding (ATCUN) motif as well as nuclear Overhauser effect (NOE) and hydrogen exchange data from recent studies. In addition, two new pseudo-energy minimization algorithms have been implemented that have dramatically improved the speed of ENSEMBLE population weight assignment. Finally, we have greatly improved our conformational sampling by utilizing a variety of techniques to generate both random structures and structures that are biased to contain elements of native-like or non-native structure. Although it is not possible to uniquely define a representative structural ensemble, we have been able to assess various properties of the drkN SH3 domain unfolded state by performing ENSEMBLE minimizations of different conformer pools. Specifically, we have found that the experimental restraint set enforces a compact structural distribution that is not consistent with an overall native-like topology but shows preference for local non-native structure in the regions corresponding to the diverging turn and the beta5 strand of the folded state and for local native-like structure in the region corresponding to the beta6 and beta7 strands. We suggest that this approach could be generally useful for the structural characterization of disordered states.     

Rapid sampling of local minima in protein energy surface and effective reduction through a multi-objective filter

Background

Many problems in protein modeling require obtaining a discrete representation of the protein conformational space as an ensemble of conformations. In ab-initio structure prediction, in particular, where the goal is to predict the native structure of a protein chain given its amino-acid sequence, the ensemble needs to satisfy energetic constraints. Given the thermodynamic hypothesis, an effective ensemble contains low-energy conformations which are similar to the native structure. The high-dimensionality of the conformational space and the ruggedness of the underlying energy surface currently make it very difficult to obtain such an ensemble. Recent studies have proposed that Basin Hopping is a promising probabilistic search framework to obtain a discrete representation of the protein energy surface in terms of local minima. Basin Hopping performs a series of structural perturbations followed by energy minimizations with the goal of hopping between nearby energy minima. This approach has been shown to be effective in obtaining conformations near the native structure for small systems. Recent work by us has extended this framework to larger systems through employment of the molecular fragment replacement technique, resulting in rapid sampling of large ensembles.

Methods

This paper investigates the algorithmic components in Basin Hopping to both understand and control their effect on the sampling of near-native minima. Realizing that such an ensemble is reduced before further refinement in full ab-initio protocols, we take an additional step and analyze the quality of the ensemble retained by ensemble reduction techniques. We propose a novel multi-objective technique based on the Pareto front to filter the ensemble of sampled local minima.

Results and conclusions

We show that controlling the magnitude of the perturbation allows directly controlling the distance between consecutively-sampled local minima and, in turn, steering the exploration towards conformations near the native structure. For the minimization step, we show that the addition of Metropolis Monte Carlo-based minimization is no more effective than a simple greedy search. Finally, we show that the size of the ensemble of sampled local minima can be effectively and efficiently reduced by a multi-objective filter to obtain a simpler representation of the probed energy surface.

     

Energy Minimization for Tertiary Structure Prediction of Homologous Proteins: α1-purothionin and Viscotoxin A3 Models from Crambin

Abstract

Homologous proteins may fold into similar three-dimensional structures. Spectroscopic evidence suggests this is true for the cereal grain thionins, the mistletoe toxins, and for crambin, three classes of plant proteins. We have combined primary sequence homology and energy minimization to predict the structures α₁-purothionin (from Durum wheat) and viscotoxin A3 (from Viscum album, European mistletoe) from the high resolution (0.945 Å) crystal structure of crambin (from Crambe abyssinica). Our predictions will be verifiable because we have diffraction-quality crystals of α₁-purothionin whose structure we are have predicted. The potential energy minimizations for each protein were performed both with and without harmonic constraints to its initial backbone to explore the existence of local minima for the predicted proteins. Crambin was run as a control to examine the effects of the potential energy minimization on a protein with a well-known structure. Only α₁-purothionin which has one fewer residue in a turn region shows a significant difference for the two minimization paths. The results of these predictions suggest that α₁-purothionin and viscotoxin are amphipathic proteins, and this character may relate to the mechanism of action for these proteins. Both are mildly membrane-active and their amphipathic character is well suited for interaction with a lipid bilayer.     

Energy landscapes and properties of biomolecules

Thermodynamic and dynamic properties of biomolecules can be calculated using a coarse-grained approach based upon sampling stationary points of the underlying potential energy surface. The superposition approximation provides an overall partition function as a sum of contributions from the local minima, and hence functions such as internal energy, entropy, free energy and the heat capacity. To obtain rates we must also sample transition states that link the local minima, and the discrete path sampling method provides a systematic means to achieve this goal. A coarse-grained picture is also helpful in locating the global minimum using the basin-hopping approach. Here we can exploit a fictitious dynamics between the basins of attraction of local minima, since the objective is to find the lowest minimum, rather than to reproduce the thermodynamics or dynamics.     

An approach to the multiple-minima problem in protein folding by relaxing dimensionality. Tests on enkephalin

An algorithm for locating the region in conformational space containing the global energy minimum of a polypeptide is described. Distances are used as the primary variables in the minimization of an objective function that incorporates both energetic and distance-geometric terms. The latter are obtained from geometry and energy functions, rather than nuclear magnetic resonance experiments, although the algorithm can incorporate distances from nuclear magnetic resonance data if desired. The polypeptide is generated originally in a space of high dimensionality. This has two important consequences. First, all interatomic distances are initially at their energetically most favorable values; i.e. the polypeptide is initially at a global minimum-energy conformation, albeit a high-dimensional one. Second, the relaxation of dimensionality constraints in the early stages of the minimization removes many potential energy barriers that exist in three dimensions, thereby allowing a means of escaping from three-dimensional local minima. These features are used in an algorithm that produces short trajectories of three-dimensional minimum-energy conformations. A conformation in the trajectory is generated by allowing the previous conformation in the trajectory to evolve in a high-dimensional space before returning to three dimensions. The resulting three-dimensional structure is taken to be the next conformation in the trajectory, and the process is iterated. This sequence of conformations results in a limited but efficient sampling of conformational space. Results for test calculations on Met-enkephalin, a pentapeptide with the amino acid sequence H-Tyr-Gly-Gly-Phe-Met-OH, are presented. A tight cluster of conformations (in three-dimensional space) is found with ECEPP energies (Empirical Conformational Energy Program for Peptides) lower than any previously reported. This cluster of conformations defines a region in conformational space in which the global-minimum-energy conformation of enkephalin appears to lie.     

Estimation of uncertainties in X-ray refinement results by use of perturbed structures

The uncertainties in the refined parameters for a 1.5-A X-ray structure of carbon-monoxy (FeII) myoglobin are estimated by combining energy minimization with least-squares refinement against the X-ray data. The energy minimizations, done without reference to the X-ray data, provide perturbed structures which are used to restart conventional X-ray refinement. The resulting refined structures have the same, or better, R-factor and stereochemical parameters as the original X-ray structure, but deviate from it by 0.13 A rms for the backbone atoms and 0.31 A rms for the sidechain atoms. Atoms interacting with a disordered sidechain, Arg 45 CD3, are observed to have larger positional uncertainties. The uncertainty in the B-factors, within the isotropic harmonic motion approximation, is estimated to be 15%. The resulting X-ray structures are more consistent with the energy parameters used in simulations.     

Optimal experiment selection for parameter estimation in biological differential equation models

ABSTRACT: BACKGROUND: Parameter estimation in biological models is a common yet challenging problem. In this work we explore the problem for gene regulatory networks modeled by differential equations with unknown parameters, such as decay rates, reaction rates, Michaelis-Menten constants, and Hill coefficients. We explore the question to what extent parameters can be efficiently estimated by appropriate experimental selection. RESULTS: A minimization formulation is used to find the parameter values that best fit the experiment data. When the data is insufficient, the minimization problem often has many local minima that fit the data reasonably well. We show that selecting a new experiment based on the local Fisher Information of one local minimum generates additional data that allows one to successfully discriminate among the many local minima. The parameters can be estimated to high accuracy by iteratively performing minimization and experiment selection. We show that the experiment choices are roughly independent of which local minima is used to calculate the local Fisher Information. CONCLUSIONS: We show that by an appropriate choice of experiments, one can, in principle, efficiently and accurately estimate all the parameters of gene regulatory network. In addition, we demonstrate that appropriate experiment selection can also allow one to restrict model predictions without constraining the parameters using many fewer experiments. We suggest that predicting model behaviors and inferring parameters represent two different approaches to model calibration with different requirements on data and experimental cost.     

Construction of Selection Indexes with Restrictions

In this paper the problem of unistage selection with inequality constraints is formulated. If the predictor and criterion variables are all normally distributed, this problem can be written as a convex programming problem, with a linear objective function and with linear constraints and a quadratic constraint. Using the duality theory, for convex nonlinear programming it is proved, that its dual problem can be transformed into a convex minimization problem with non-negativity conditions. Good computational methods are known for solving this problem. By the help of the dual problem sufficient conditions for a solution of the original primal problem are derived and illustrated by an example of practical interest.     

Preference of small molecules for local minimum conformations when binding to proteins

It is well known that small molecules (ligands) do not necessarily adopt their lowest potential energy conformations when binding to proteins. Analyses of protein-bound ligand crystal structures have reportedly shown that many of them do not even adopt the conformations at local minima of their potential energy surfaces (local minimum conformations). The results of these analyses raise a concern regarding the validity of virtual screening methods that use ligands in local minimum conformations. Here we report a normal-mode-analysis (NMA) study of 100 crystal structures of protein-bound ligands. Our data show that the energy minimization of a ligand alone does not automatically stop at a local minimum conformation if the minimum of the potential energy surface is shallow, thus leading to the folding of the ligand. Furthermore, our data show that all 100 ligand conformations in their protein-bound ligand crystal structures are nearly identical to their local minimum conformations obtained from NMA-monitored energy minimization, suggesting that ligands prefer to adopt local minimum conformations when binding to proteins. These results both support virtual screening methods that use ligands in local minimum conformations and caution about possible adverse effect of excessive energy minimization when generating a database of ligand conformations for virtual screening.     

The embedding problem for predistance matrices

A fundamental problem in molecular biology is the determination of the conformation of macromolecules from NMR data. Several successful distance geometry programs have been developed for this purpose, for example DISGEO. A particularly difficult facet of these programs is the embedding problem, that is the problem of determining those conformations whose distances between atoms are nearest those measured by the NMR techniques. The embedding problem is the distance geometry equivalent of the multiple minima problem, which arises in energy minimization approaches to conformation determination. We show that the distance geometry approach has some nice geometry not associated with other methods that allows one to prove detailed results with regard to the location of local minima. We exploit this geometry to develop some algorithms which are faster and find more minima than the algorithms presently used. The authors were partially supported by National Science Foundation Grant CHE-8802341.