Employing Reduced Order Approach for Computing Protein Folding via Langevin Equation and Lyapunov Theorem

勤益科大機構典藏 > 電資學院 > 電機工程系(所) > 【電機工程系所】期刊論文 > Item 987654321/7015

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncut.edu.tw/handle/987654321/7015

题名:	Employing Reduced Order Approach for Computing Protein Folding via Langevin Equation and Lyapunov Theorem
作者:	宋文財
贡献者:	電機工程(學)系
日期:	2012-06
上传时间:	2018-01-07
摘要:	Molecular structure computation involves an NP-complete algorithm. The order of the distance matrix is especially important, and reduced order processing is attempted to accelerate the folding computation. In my previous researches, the Ullman algorithm and the scoring function with force field simulation are used to reduce the dimensionality of the determinant and evaluate some important parameters for molecular docking acceleration. Additionally, the emergence of brand-new molecular structure processing is expected, and in particular, a simpler and more effective computation model can be established. This paper succeeds in using the Langevin Equation and Laplace's theorem for reducing molecular order, and employing Lyapunov theorem to delete some points that have local minimum energy for accelerating the calculation of protein folding.
關聯:	International Journal of Innovative Computing, Information and Control,
显示于类别:	[電機工程系(所)] 【電機工程系所】期刊論文

文件中的档案:

没有与此文件相关的档案.

检视Licence

在NCUTIR中所有的数据项都受到原著作权保护.