Numerical solutions of a master equation for protein folding kinetics Online publication date: Thu, 05-Oct-2006
by Yiming Li
International Journal of Bioinformatics Research and Applications (IJBRA), Vol. 2, No. 4, 2006
Abstract: The numerical solution of a master equation involves the calculation of eigenpairs for the corresponding transition matrix. In this paper, we computationally study the folding rate for a kinetics problem of protein folding by solving a large-scale eigenvalue problem. Three numerical methods, the implicitly restarted Arnoldi, the Jacobi-Davidson, and the QR methods are applied to solve the corresponding large-scale eigenvalue problem of the transition matrix of the master equation. Comparison among three methods is performed in terms of the computational efficiency. It is found that the QR method demands tremendous computing resource when the length of sequence L > 10 due to the extremely large size of matrix and CPU time limitation. The Jacobi-Davidson method may encounter convergence issues, for some testing cases with L > 9. Among the three solution methods the implicitly restarted Arnoldi method is suitable for solving the problem. Numerical examples with various residues are investigated.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bioinformatics Research and Applications (IJBRA):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook