首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
A general method designed to isolate the global minimum of a multidimensional objective function with multiple minima is presented. The algorithm exploits an integral “coarse-graining” transformation of the objective function, U, into a smoothed function with few minima. When the coarse-graining is defined over a cubic neighborhood of length scale ϵ, the exact gradient of the smoothed function, 𝒰ϵ, is a simple three-point finite difference of U. When ϵ is very large, the gradient of 𝒰ϵ appears to be a “bad derivative” of U. Because the gradient of 𝒰ϵ is a simple function of U, minimization on the smoothed surface requires no explicit calculation or differentiation of 𝒰ϵ. The minimization method is “derivative-free” and may be applied to optimization problems involving functions that are not smooth or differentiable. Generalization to functions in high-dimensional space is straightforward. In the context of molecular conformational optimization, the method may be used to minimize the potential energy or, preferably, to maximize the Boltzmann probability function. The algorithm is applied to conformational optimization of a model potential, Lennard–Jones atomic clusters, and a tetrapeptide. © 1998 John Wiley & Sons, Inc. J Comput Chem 19: 1445–1455, 1998  相似文献   

2.
    
The multicanonical (Muca) Monte Carlo method enables simulating a system over a wide range of temperatures and thus has become an efficient tool for studying spin glasses, first‐order phase transitions, the helix–coil transition of polypeptides, and protein folding. However, implementation of the method requires calculating the multicanonical weights by an iterative procedure that is not straightforward and is a stumbling block for newcomers. A recursive procedure that takes into account the statistical errors of all previous iterations and thus enables an automatic calculation of the weights without the need for human intervention after each iteration has been proposed. This procedure, which has already been tested successfully for lattice systems, is extended here to continuum models of peptides and proteins. The method is examined in detail and tested for models of the pentapeptide Leu‐enkephalin (Tyr‐Gly‐Gly‐Phe‐Leu) described by the potential energy function ECEPP. Because of the great interest in the structural mapping of the low‐energy region of biomolecules, the energy of structures selected from the Muca trajectory is minimized. The extent of conformational coverage provided by the method is examined and found to be very satisfactory. © 2000 John Wiley & Sons, Inc. J Comput Chem 21: 1251–1261, 2000  相似文献   

3.
    
Database-assisted ab initio protein structure prediction methods have exhibited considerable promise in the recent past, with several implementations being successful in community-wide experiments (CASP). We have employed combinatorial optimization techniques toward solving the protein structure prediction problem. A Monte Carlo minimization algorithm has been employed on a constrained search space to identify minimum energy configurations. The search space is constrained by using radius of gyration cutoffs, the loop backbone dihedral probability distributions, and various secondary structure packing conformations. Simulations have been carried out on several sequences and 1000 conformations have been initially generated. Of these, 50 best candidates have then been selected as probable conformations. The search for the optimum has been simplified by incorporating various geometrical constraints on secondary structural elements using distance restraint potential functions. The advantages of the reported methodology are its simplicity, and modifiability to include other geometric and probabilistic restraints.  相似文献   

4.
Recent experimental and theoretical cluster studies are reviewed. Areas of current and developing interest in theoretical and computational chemistry are identified. Some promising methods applied to metal clusters, main group clusters, molecular clusters, spectroscopy, and models of cluster-molecule reactions are indicated. Results of calculations on small hydrogenated lithium clusters and hydrated sodium clusters are discussed in some detail.  相似文献   

5.
    
Replica Exchange Molecular Dynamics (REMD) method is a powerful sampling tool in molecular simulations. Recently, we made a modification to the standard REMD method. It places some inactive replicas at different temperatures as well as the active replicas. The method completely decouples the number of the active replicas and the number of the temperature levels. In this article, we make a further modification to our previous method. It uses the inactive replicas in a different way. The inactive replicas first sample in their own knowledge‐based energy databases and then participate in the replica exchange operations in the REMD simulation. In fact, this method is a hybrid between the standard REMD method and the simulated tempering method. Using different active replicas, one can freely control the calculation quantity and the convergence speed of the simulation. To illustrate the performance of the method, we apply it to some small models. The distribution functions of the replicas in the energy space and temperature space show that the modified REMD method in this work can let the replicas walk freely in both of the two spaces. With the same number of the active replicas, the free energy surface in the simulation converges faster than the standard REMD. © 2016 Wiley Periodicals, Inc.  相似文献   

6.
    
Efficient conformational search or sampling approaches play an integral role in molecular modeling, leading to a strong demand for even faster and more reliable conformer search algorithms. This article compares the efficiency of a molecular dynamics method, a simulated annealing method, and the basin hopping (BH) approach (which are widely used in this field) with a previously suggested tabu‐search‐based approach called gradient only tabu search (GOTS). The study emphasizes the success of the GOTS procedure and, more importantly, shows that an approach which combines BH and GOTS outperforms the single methods in efficiency and speed. We also show that ring structures built by a hydrogen bond are useful as starting points for conformational search investigations of peptides and organic ligands with biological activities, especially in structures that contain multiple rings. © 2011 Wiley Periodicals, Inc. J Comput Chem, 2011  相似文献   

7.
Saturation transfer difference (STD)‐NMR spectroscopy was used to probe experimentally the bioactive solution conformation of the carbohydrate mimic MDWNMHAA 1 of the O‐polysaccharide of Shigella flexneri Y when bound to its complementary antibody, mAb SYA/J6. Molecular dynamics simulations using the ZymeCAD? Molecular Dynamics platform were also undertaken to give a more accurate picture of the conformational flexibility and the possibilities for bound ligand conformations. The ligand topology, or the dynamic epitope, was mapped with the CORCEMA‐ST (COmplete Relaxation and Conformational Exchange Matrix Analysis of Saturation Transfer) program that calculates a total matrix analysis of relaxation and exchange effects to generate predicted STD‐NMR intensities from simulation. The comparison of these predicted STD enhancements with experimental data was used to select a representative binding mode. A protocol that employed theoretical STD effects calculated at snapshots during the entire course of a molecular dynamics (MD) trajectory of the peptide bound to the Fv portion of the antibody, and not the averaged atomic positions of receptor–ligand complexes, was also examined. In addition, the R factor was calculated on the basis of STD (fit) to avoid T1 bias, and an effective R factor, Reff, was defined such that if the calculated STD (fit) for proton k was within error of the experimental STD (fit) for proton k, then that calculated STD (fit) for proton k was not included in the calculation of the R factor. This protocol was effective in deriving the antibody‐bound solution conformation of the peptide which also differed from the bound conformation determined by X‐ray crystallography; however, several discrepancies between experimental and calculated STD (fit) values were observed. The bound conformation was therefore further refined with a simulated annealing refinement protocol known as STD‐NMR intensity‐restrained CORCEMA optimization (SICO) to give a more accurate representation of the bound peptide epitope. Further optimization was required in this case, but a satisfactory correlation between experimental and calculated STD values was obtained. Attempts were also made to obtain STD enhancements with a synthetic pentasaccharide hapten, corresponding to the O‐polysaccharide, while bound to the antibody. However, unfavorable kinetics of binding in this system prevented sufficient STD build‐up, which, in turn, hindered a rigorous analysis via full STD build‐up curves.  相似文献   

8.
    
The Monte Carlo simulated annealing method is adapted to optimize correlated Gaussian‐type functions in nonrelativistic molecular environments. Starting from an atom‐centered atomic Gaussian basis set, the uncontracted functions are reoptimized in the molecular environments corresponding to the H2O, CN?, N2, CO, BF, NO+, CO2, and CS systems. These new molecular adapted basis sets are used to calculate total energies, harmonic vibrational frequencies, and equilibrium geometries at a correlated level of theory. The present methodology is a simple and effective way to improve molecular correlated wave functions, without the need to enlarge the molecular basis set. Additionally, this methodology can be used to generate hierarchical sequences of molecular basis sets with increasing size, which are relevant to establish complete basis set limits. © 2014 Wiley Periodicals, Inc.  相似文献   

9.
    
Conformational Memories (CM) is a simulated annealing/Monte Carlo method that explores peptide and protein dihedral conformational space completely and efficiently, independent of the original conformation. Here we extend the CM method to include the variation of a randomly chosen bond angle, in addition to the standard variation of two or three randomly chosen dihedral angles, in each Monte Carlo trial of the CM exploratory and biased phases. We test the hypothesis that the inclusion of variable bond angles in CM leads to an improved sampling of conformational space. We compare the results with variable bond angles to CM with no bond angle variation for the following systems: (1) the pentapeptide Met-enkephalin, which is a standard test case for conformational search methods; (2) the proline ring pucker in a 17mer model peptide, (Ala)(8)Pro(Ala)(8); and (3) the conformations of the Ser 7.39 chi(1) in transmembrane helix 7 (TMH7) of the cannabinoid CB1 receptor, a 25-residue system. In each case, analysis of the CM results shows that the inclusion of variable bond angles results in sampling of regions of conformational space that are inaccessible to CM calculations with only variable dihedral angles, and/or a shift in conformational populations from those calculated when variable bond angles are not included. The incorporation of variable bond angles leads to an improved sampling of conformational space without loss of efficiency. Our examples show that this improved sampling leads to better exploration of biologically relevant conformations that have been experimentally validated.  相似文献   

10.
A discrete-state ab initio protein structure prediction procedure is presented, based on the assumption that some proteins fold in an hierarchical way, where the early folding of independent units precedes and helps complete structure formation. It involves a first step predicting, by means of threading algorithms and local structure prediction methods, the location of autonomous protein subunits presenting favorable local and tertiary interactions. The second step consists of predicting the structure of these units by Monte Carlo simulated annealing using several database-derived potentials. In a last step, these predicted structures are used as starting conformations of additional simulations, keeping these structures frozen and including the complete protein sequence. This procedure is applied to two small DNA-binding proteins, 434 cro and the Drosophila melanogaster homeodomain that contain 65 and 47 residues, respectively, and is compared to the nonhierarchical procedure where the whole protein is predicted in a single run. The best predicted structures were found to present root-mean-square deviations relative to the native conformation of 2.7 ? in the case of the homeodomain and of 3.9 ? for 434 cro; these structures thus represent low-resolution models of the native structures. Strikingly, not only the helices were correctly predicted but also intervening turn motifs. Received: 6 July 2000 / Accepted: 8 September 2000 / Published online: 21 December 2000  相似文献   

11.
12.
    
A common technique for the numerical calculation of free energies involves estimation of the probability density along a given coordinate from a set of configurations generated via simulation. The process requires discretization of one or more reaction coordinates to generate a histogram from which the continuous probability density is inferred. We show that the finite size of the intervals used to construct the histogram leads to quantifiable systematic error. The width of these intervals also determines the statistical error in the free energy, and the choice of the appropriate interval is therefore driven by the need to balance the two sources of error. We present a method for the construction of the optimal histogram for a given system, and show that the use of this technique requires little additional computational expense. We demonstrate the efficacy of the technique for a model system, and discuss how the principles governing the choice of discretization interval could be used to improve extended sampling techniques.  相似文献   

13.
We propose a stochastic optimization technique based on a generalized simulated annealing (GSA) method for mapping minima points of molecular conformational energy surfaces. The energy maps are obtained by coupling a classical molecular force field (THOR package) with a GSA procedure. Unlike the usual molecular dynamics (MD) method, the method proposed in this study is force independent; that is, we obtain the optimized conformation without calculating the force, and only potential energy is involved. Therefore, we do not need to know the conformational energy gradient to arrive at equilibrium conformations. Its utility in molecular mechanics is illustrated by applying it to examples of simple molecules (H2O and H2O3) and to polypeptides. The results obtained for H2O and H2O3 using Tsallis thermostatistics suggest that the GSA approach is faster than the other two conventional methods (Boltzmann and Cauchy machines). The results for polypeptides show that pentalanine does not form a stable α-helix structure, probably because the number of hydrogen bonds is insufficient to maintain the helical array. On the contrary, the icoalanine molecule forms an α-helix structure. We obtain this structure simulating all Φ, Ψ pairs using only a few steps, as compared with conventional methods. © 1998 John Wiley & Sons, Inc. J Comput Chem 19: 647–657, 1998  相似文献   

14.
    
A comparative study was carried out to test the efficiency with which Metropolis Monte Carlo (MC) and stochastic dynamics (SD) sample the potential energy surface of the N-acetyl glycyl glycine methylamide peptide as defined by the united atom AMBER* force field. Boltzmann-weighted ensembles were generated with variations of all internal degrees of freedom (i.e., stretch, bend, and torsion) for a single N-acetyl glycyl glycine methylamide molecule at 300 K by 108-step MC and 100-ns SD simulations. As expected, both methods gave the same final energetic results. However, convergence was found to be ∼10 times faster with MC than with SD as measured by comparisons of the populations of all symmetrically equivalent conformers. © 1998 John Wiley & Sons, Inc. J Comput Chem 19: 1294–1299, 1998  相似文献   

15.
    
A new and efficient method for overcoming the multiple minima problem of polypeptides, the systematic stepsize variation (SSV) method, is presented. The SSV is based on the assumption that energy barriers can be passed over by sufficiently large rotations about rotatable bonds: randomly chosen dihedral angles are updated starting with a small stepsize (i.e., magnitude of rotation). A new structure is accepted only if it possesses a lower energy than the precedent one. Local minima are passed over by increasing the stepsize systematically. When no new structures are found any longer, the simulation is continued with the starting structure, but other trajectories will be followed due to the random order in updating the torsional angles. First, the method is tested with Met-enkephalin, a peptide with a known global minimum structure; in all runs the latter is found at least once. The global minimum conformations obtained in the simulations show deviations of ±0.0004 kcal/mol from the reference structure and, consequently, are perfectly superposable. For comparison, Metropolis Monte Carlo simulated annealing (MMC-SA) is performed. To estimate the efficiency of the algorithm depending on the complexity of the optimization problem, homopolymers of Ala and Gly of different lengths are simulated, with both the SSV and the MMC-SA method. The comparative simulations clearly reveal the higher efficiency of SSV compared with MMC-SA. © 1998 John Wiley & Sons, Inc. J Comput Chem 19: 1470–1481, 1998  相似文献   

16.
    
The advantage of the multicanonical (MUCA) simulation method of Berg and coworkers over the conventional Metropolis method is in its ability to move a system effectively across energy barriers thereby providing results for a wide range of temperatures. However, a MUCA simulation is based on weights (related to the density of states) that should be determined prior to a production run and their calculation is not straightforward. To overcome this difficulty a procedure has been developed by Berg that calculates the MUCA weights automatically. In a previous article (Ya?ar et al. J Comput Chem 2000, 14, 1251-1261) we extended this procedure to continuous systems and applied it successfully to the small pentapeptide Leu-enkephalin. To investigate the performance of the automated MUCA procedure for larger peptides, we apply it here to deltorphin, a linear heptapeptide with bulky side chains (H-Tyr(1)-D-Met(2)-Phe(3)-His(4)-Leu(5)-Met(6)-Asp(7)-NH(2)). As for Leu-enkephalin, deltorphin is modeled in vacuum by the potential energy function ECEPP. MUCA is found to perform well. A weak second peak is seen for the specific heat, which is given a special attention. By minimizing the energy of structures along the trajectory it is found that MUCA provides a good conformational coverage of the low energy region of the molecule. These latter results are compared with conformational coverage obtained by the Monte Carlo minimization method of Li and Scheraga.  相似文献   

17.
    
Global minimization algorithm is indispensable to solving the protein folding problem based upon thermodynamic hypothesis. Here we propose a pseudo potential function, contact difference(CD), for simulating empirical contact potential functions and testing global minimization algorithm. The present paper covers conformational sampling and global minimization algorithm called BML03, based upon Monte Carlo and simulated annealing, which is able to locate CD‘s global minimum and refold extended protein structures into one swith root mean square distance(RMSD) as small as 0.03 nm from the native structures. For empirieal contact potential functions, these results demonstrate that their global minimization problems may be solvable.  相似文献   

18.
    
Introduction Basedonthethermodynamichypothesis[1],any computionalapproachforsolvingproteinfoldingprob lemsoranabinitiopredictionofproteintertiarystruc turesfromtheirprimarysequences,requiresanempiri calpotentialfunctionthathasitsglobalminimumatthe natives…  相似文献   

19.
基于支持向量机方法的HERG钾离子通道抑制剂分类模型   总被引:1,自引:0,他引:1  
对human ether-a-gō-gō related genes(HERG)钾离子通道(钾通道)抑制剂,计算了表征分子组成、电荷分布、拓扑、几何结构及物理化学性质等特征的1559个分子描述符.采用Fischer Score(F-Score)排序过滤和Monte Carlo模拟退火法相结合从中筛选与HERG钾通道抑制剂分类相关的分子描述符.采用支持向量机(SVM)方法,分别以IC50=1.0、10.0μmol·L-1为分类标准,建立了三个分类预测模型.对367个训练集分子,用五重交叉验证.得到正、负样本的平均预测精度分别为84.8%-96.6%、80.7%-97.7%,其总的平均预测精度为87.1%-97.2%,优于其它文献报道结果.对97个外部测试集分子,所建三个模型的总样本预测精度在67.0%-90.1%之间,接近或优于其它文献报道结果.  相似文献   

20.
    
We assess the efficiency of molecular dynamics (MD), Monte Carlo (MC), and genetic algorithms (GA) for docking five representative ligand–receptor complexes. All three algorithms employ a modified CHARMM-based energy function. The algorithms are also compared with an established docking algorithm, AutoDock. The receptors are kept rigid while flexibility of ligands is permitted. To test the efficiency of the algorithms, two search spaces are used: an 11-Å-radius sphere and a 2.5-Å-radius sphere, both centered on the active site. We find MD is most efficient in the case of the large search space, and GA outperforms the other methods in the small search space. We also find that MD provides structures that are, on average, lower in energy and closer to the crystallographic conformation. The GA obtains good solutions over the course of the fewest energy evaluations. However, due to the nature of the nonbonded interaction calculations, the GA requires the longest time for a single energy evaluation, which results in a decreased efficiency. The GA and MC search algorithms are implemented in the CHARMM macromolecular package. © 1998 John Wiley & Sons, Inc. J Comput Chem 19: 1623–1631, 1998  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号