期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
A Global Minimization Algorithm for Empirical Contact Potential Functions
1
作者 WANG Yu-hong LI Wei 《Chemical Research in Chinese Universities》 SCIE CAS CSCD 2006年第2期248-250,共3页
Global minimization algorithm is indispensable for solving protein folding problems based on thermodynamic hypothesis. A contact difference (CD) based on pseudo potential function, for simulating empirical contact p... Global minimization algorithm is indispensable for solving protein folding problems based on thermodynamic hypothesis. A contact difference (CD) based on pseudo potential function, for simulating empirical contact potential functions and testing global minimization algorithm was proposed. The present article describes a conformational sampiing and global minimization algorithm, which is called WL, based on Monte Carlo simulation and simulated annealing. It can be used to locate CD's globe minimum and refold extended protein structures, as small as 0. 03 nm, from the native structures, back to ones with root mean square distance(RMSD). These results demonstrate that the global minimization problems for empirical contact potential functions may be solvable. 展开更多
关键词 global minimization contact potential function simulated annealing monte carlo simulation
下载PDF
A Global Minimization Algorithm for Empirical Contact Potential Functions
2
作者 WANGYu-hong LIWei 《Chemical Research in Chinese Universities》 SCIE CAS CSCD 2004年第5期572-574,共3页
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 ... 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 ones with root mean square distance(RMSD) as small as 0.03 nm from the native structures. For empirical contact potential functions, these results demonstrate that their global minimization problems may be solvable. 展开更多
关键词 global minimization contact potential function simulated annealing monte carlo simulation
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部