Please use this identifier to cite or link to this item:
https://doi.org/10.1007/11732990_34
Title: | Predicting experimental quantities in protein folding kinetics using stochastic roadmap simulation | Authors: | Chiang, T.-H. Apaydin, M.S. Brutlag, D.L. Hsu, D. Latombe, J.-C. |
Issue Date: | 2006 | Citation: | Chiang, T.-H.,Apaydin, M.S.,Brutlag, D.L.,Hsu, D.,Latombe, J.-C. (2006). Predicting experimental quantities in protein folding kinetics using stochastic roadmap simulation. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 3909 LNBI : 410-424. ScholarBank@NUS Repository. https://doi.org/10.1007/11732990_34 | Abstract: | This paper presents a new method for studying protein folding kinetics. It uses the recently introduced Stochastic Roadmap Simulation (SRS) method to estimate the transition state ensemble (TSE) and predict the rates and Φ-values for protein folding. The new method was tested on 16 proteins. Comparison with experimental data shows that it estimates the TSE much more accurately than an existing method based on dynamic programming. This leads to better folding-rate predictions. The results on Φ-value predictions are mixed, possibly due to the simple energy model used in the tests. This is the first time that results obtained from SRS have been compared against a substantial amount of experimental data. The success further validates the SRS method and indicates its potential as a general tool for studying protein folding kinetics. © Springer-Verlag Berlin Heidelberg 2006. | Source Title: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | URI: | http://scholarbank.nus.edu.sg/handle/10635/40156 | ISBN: | 3540332952 | ISSN: | 03029743 | DOI: | 10.1007/11732990_34 |
Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.