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

NCUTIR > College of Electrical Engineering and Computer Science > Department of Electrical Engineering > 【電機工程系所】期刊論文 > Item 987654321/7015

Please use this identifier to cite or link to this item: http://ir.lib.ncut.edu.tw/handle/987654321/7015

Title:	Employing Reduced Order Approach for Computing Protein Folding via Langevin Equation and Lyapunov Theorem
Authors:	宋文財
Contributors:	電機工程(學)系
Date:	2012-06
Issue Date:	2018-01-07
Abstract:	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.
Relation:	International Journal of Innovative Computing, Information and Control,
Appears in Collections:	[Department of Electrical Engineering] 【電機工程系所】期刊論文

Files in This Item:

There are no files associated with this item.

View Licence