Mehmet Serkan Apaydin
ABSTRACT
Classic techniques for simulating molecular motion, such as the Monte Carlo and molecular dynamics methods, generate individual motion pathways one at a time and spend most of their time trying to escape from the local minima of the energy landscape of a molecule. Their high computational cost prevents them from being used to analyze many pathways. We introduce Stochustic Roadmap Sirrrcllation (SRS), a new approach for exploring the kinetics of molecular motion by simultaneously examining multiple pathways encoded compactly in a graph, called a roadmap. A roadmap is computed by sampling a molecule's conformation space at random. The computation does not suffer from the localminima problem encountered with existing methods. Each path in the roadmap represents a potential motion pathway and is associated with a probability indicating the likelihood that the molecule follows this pathway. By viewing the roadmap as a Markov chain, we can efficiently compute kinetic properties of molecular motion over the entire molecular energy landscape. We also prove that, in the limit, SRS converges to the same distribution as Monte Carlo simulation. To test the effectiveness of our approach, we apply it to the computation of the transmission coefficients for protein folding, an important order parameter that measures the "kinetic distance" of a protein's conformation to its native state Our computational studies show that SRS obtains more accurate results and achieves several orders- of- magnitude reduction in computation time, compared with Monte Carlo simulatio.
- C.B. Anfinsen. Principles that govern the folding of protein chains. Science, 181:223--230, 1973.Google Scholar
Cross Ref
- M.S. Apaydin, A.P. Singh, D.L. Brutlag, and J.C. Latombe. Capturing molecular energy landscapes with probabilistic conformational roadmaps. In Proc. IEEE Int. Conf. on Robotics and Automation, 2001.Google ScholarCross Ref
- F.C. Bernstein et al. The protein data bank: A computer-based archival file for macromolecular structure. Journal of Molecular Biology, 112(3):535--542, 1977.Google ScholarCross Ref
- J.D. Bryngelson, J.N. Onuchic, N.D. Socci, and P.G. Wolynes. Funnels, pathways, and the energy landscape of protein folding: A synthesis. Proteins: Structure, Function, and Genetics, 21(3):167--195, 1995.Google Scholar
- K.A. Dill and H.S. Chan. From levinthal to pathways to funnels. Nature Structural Biology, 4(1):10--19, 1997.Google ScholarCross Ref
- C.M. Dobson and M. Karplus. The fundamentals of protein folding: Bringing together theory and experiment. Current Opinion in Structural Biology, 9:92--101, 1999.Google ScholarCross Ref
- R. Du, V. Pande, A.Y. Grosberg, T. Tanaka, and E. Shakhnovich. On the transition coordinate for protein folding. Journal of Chemical Physics, 108(1):334--350, 1998.Google ScholarCross Ref
- A. Fersht. Structure and Mechanism in Protein Science: A Guide to Enzyme Catalysis and Protein Folding. W.H. Freeman & Company, New York, 1999.Google Scholar
- A. George and J. Liu. The evolution of the minimum degree ordering algorithm. SIAM Review, 31(1):1--19, 1989. Google ScholarDigital Library
- J.R. Gilbertand, C. Moler, and R. Schreiber. Sparse matrices in matlab: Design and implementation. SIAM Journal on Matrix Analysis and Applications, 13(1):333--356, 1992. Google ScholarDigital Library
- J.M. Haile. Molecular Dynamics Simulation: Elementary Methods. John Wiley & Sons, New York, 1992. Google ScholarDigital Library
- B. Hajek. Cooling schedules for optimal annealing. Mathematics of Operations Research, 13(2):311 -- 329, 1988. Google ScholarDigital Library
- W. Hoeffding. Probability inequalities for sum of bounded random variables. Journal of the American Statistical Association, 58:13--30, 1963.Google ScholarCross Ref
- A. Kolinski and J. Skolnick. Lattice Models of Protein Folding, Dynamics and Thermodynamics. Chapmann & Hall, New York, 1996.Google Scholar
- L. Kavraki, P. Švestka, J.C. Latombe, and M.H. Overmars. Probabilistic roadmaps for path planning in high-dimensional configuration space. IEEE Transactions on Robotics and Automation, 12(4):566--580, 1996.Google ScholarCross Ref
- M.H. Kalos and P.A. Whitlock. Monte Carlo Methods, volume 1. John Wiley & Son, New York, 1986. Google ScholarDigital Library
- A.R. Leach. Molecular Modelling: Principles and Applications. Longman, Essex, England, 1996.Google Scholar
- V.S. Pande, A.Y. Grosberg, T. Tanaka, and D.S. Rokhsar. Pathways for protein folding: Is a new view needed? Current Opinion in Structural Biology, 8:68--79, 1998.Google ScholarCross Ref
- W.H. Press, S.A. Teukolsky, W.T. Vetterling, and B.P. Plannery. Numerical Recipes in C. Cambridge University Press, 2nd edition, 1992.Google Scholar
- G. Song and N.M. Amato. Using motion planning to study protein folding pathways. In Proc. ACM Int. Conf. on Computational Biology (RECOMB), pages 287--296, 2001. Google ScholarDigital Library
- A.P. Singh and D.L. Brutlag. Hierarchical protein structure superposition using both secondary structure and atomic representations. In Proc. Int. Conf. on Intelligent Systems for Molecular Biology, pages 284--293, 1997. Google ScholarDigital Library
- J. Shimada, E.L. Kussell, and E.I. Shakhnovich. The folding thermodynamics and kinetics of crambin using an all-atom monte carlo simulation. Journal of Molecular Biology, 308(1):79--95, 2001.Google ScholarCross Ref
- A.P. Singh, J.C. Latombe, and D.L. Brutlag. A motion planning approach to flexible ligand binding. In Proc. Int. Conf. on Intelligent Systems for Molecular Biology, pages 252--261, 1999. Google ScholarDigital Library
- S. Sun, P.D. Thomas, and K.A. Dill. A simple protein folding algorithm using a binary code and secondary structure constraints. Protein Engineering, 8:769--778, 1995.Google ScholarCross Ref
- H. Taylor and S. Karlin. An Introduction to Stochastic Modeling. Academic Press, New York, 3rd edition, 1994.Google Scholar
Index Terms
- Stochastic roadmap simulation: an efficient representation and algorithm for analyzing molecular motion
Recommendations
Predicting experimental quantities in protein folding kinetics using stochastic roadmap simulation
RECOMB'06: Proceedings of the 10th annual international conference on Research in Computational Molecular BiologyThis 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. ...
An investigation of molecular dynamics simulation and molecular docking: Interaction of citrus flavonoids and bovine β-lactoglobulin in focus
Citrus flavonoids are natural compounds with important health benefits. The study of their interaction with a transport protein, such as bovine @b-lactoglobulin (BLG), at the atomic level could be a valuable factor to control their transport to ...
Comments