Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/369133.369239acmconferencesArticle/Chapter ViewAbstractPublication PagesrecombConference Proceedingsconference-collections
Article

Using motion planning to study protein folding pathways

Published: 22 April 2001 Publication History

Abstract

We present a framework for studying protein folding pathways and potential landscapes which is based on techniques recently developed in the robotics motion planning community. In particular, our work uses Probabilistic Roadmap (PRM) motion planning techniques which have proven to be very successful for problems involving high-dimensional configuration spaces. Our results applying PRM techniques to several small proteins (60 residues) are very encouraging. The framework enables one to easily and efficiently compute folding pathways from any denatured starting state to the native fold. This aspect makes our approach ideal for studying global properties of the protein's potential landscape. For example, our results show that folding pathways from different starting denatured states sometimes share some common `gullies', mainly when they are close to the native fold. Such global issues are difficult to simulate and study with other methods.
Our focus in this work is to study the protein folding mechanism assuming we know the native fold. Therefore, instead of performing fold prediction, we aim to study issues related to the folding process, such as the formation of secondary and tertiary structure, and the dependence on the initial conformation. Our results indicate that for some proteins, secondary structure clearly forms first while for others the tertiary structure is obtained more directly, and moreover, these situations seem to be differentiated in the distributions of the conformations sampled by our technique. We also find that the formation order is independent of the starting denatured conformation. We validate our results by comparing the secondary structure formation order on our paths to known pulse-labeling experimental results. This indicates the promise of our approach for studying proteins for which experimental results are not available.

References

[1]
E. Alm and D. Baker. Prediction of protein-folding mechanisms from free-energy landscapes derived from native structures. Proc. Natl. Acad. Sci. USA, 1999.
[2]
N. M. Amato, O. B. Bayazit, L. K. Dale, C. V. Jones, and D. Vallejo. OBPRM: An obstacle-based PRM for 3D workspaces. In Proc. Int. Workshop on Algorithmic Foundations of Robotics (WAFR), pages 155-168, 1998.
[3]
C.B. Anfinsen. Principles that govern the folding of protein chains. Science, 181:223-230, 1973.
[4]
D. Baker. A surprising simplicity to protein folding. Nature, 405:39-42, 2000.
[5]
O. B. Bayazit, G. Song, and N. M. Amato. Enhancing randomized motion planners: Exploring with haptic hints. In Proc. IEEE Int. Conf. Robot. Autom. (ICRA), pages 529-536, 2000.
[6]
T. Biedl, E. Demaine, M. Demaine, S. Lazard, A. Lubiw, J. O'Rourke, M. Overmars, S. Robbins, I. Streinu, G. Toussaint, and S. Whitesides. Locked and unlocked polygonal chains in 3D. In Proc. 10th ACM-SIAM Sympos. Discrete Algorithms, pages 866-867, January 1999.
[7]
V. Boor, M. H. Overmars, and A. F. van der Stappen. The gaussian sampling strategy for probabilistic roadmap planners. In Proc. IEEE Int. Conf. Robot. Aurora. (ICRA), pages 1018-1023, 1999.
[8]
J.U. Bowie and D. Eisenberg. An evolutionary approach to folding small a-helical proteins that uses sequence information and an empirical guiding fitness function. Proc. Natl. Acad. Sci. USA, 91:4436-4440, 1994.
[9]
J. Cantarella and H. Johnston. Nontrivial embeddings of polygonal intervals and unknots in 3-space. J. Knot Theory Ramifications, 7:1027-1039, 1998.
[10]
D.G. Covell. Folding protein a-carbon chains into compact forms by monte carlo methods. Proteins: Struct. Funct. Genet., 14:409-420, 1992.
[11]
V. Daggett and M. Levitt. Realistic simulation of naive-protein dynamics in solution and beyond. Annu Rev Biophys Biomol Struct, 22:353-380, 1993.
[12]
Y. Duan and P.A. Kollman. Pathways to a protein folding intermediate observed in a 1-microsecond simulation in aqueous solution. Science, 282:740-744, 1998.
[13]
W.A. Eaton, V. Mufioz, P.A.Thompson, C. Chan, and J. Hofrichter. Submillisecond kinetics of protein folding. Curt. Op. Str. Bio., 7:10-14, 1997.
[14]
K.M. Fiebig and K.A. Dill. Protein core assembly processes. J. Chem. Phys, 98(4):3475-3487, 1993.
[15]
J.M. Haile. Molecular Dynamics Simulation: elementary methods. Wiley, New York, 1992.
[16]
L. Han and N. M. Amato. A kinematics-based probabilistic roadmap method for closed chain systems. In Proc. Int. Workshop on Algorithmic Foundations of Robotics (WAFR), 2000.
[17]
B. Honig. Protein folding: From the levinthal paradox to structure prediction. J. Mol. Bio., 293:283-293, 1999.
[18]
D. Hsu, L. Kavraki, J-C. Latombe, R. Motwani, and S. Sorkin. On finding narrow passages with probabilistic roadmap planners. In Proc. Int. Workshop on Algorithmic Foundations of Robotics (WAFR), 1998.
[19]
G. N. Reeke Jr. Protein folding: Computational approaches to an exponential-time problem. Ann. Rev. Comput. Sci., 3:59-84, 1988.
[20]
L. Kavraki. Random Networks in Configuration Space for Fast Path Planning. PhD thesis, Stanford Univ, Computer Science Dept., 1995.
[21]
L. Kavraki, P. Svestka, J. C. Latombe, and M. Overmars. Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans. Robot. Automat., 12(4):566-580, August 1996.
[22]
A. Kolinski and J. Skolnick. Monte carlo simulations of protein folding. Proteins Struct. Funct. Genet., 18:338-352, 1994.
[23]
J. Kuszewski, G.M. Clore, and A.M. Gronenborn. Fasting folding of a prototypic polypeptide: The immunoglobulin binding domain of streptococcal protein g. Protein Science, 3:1945-1952, 1994.
[24]
J. C. Latombe. Robot Motion Planning. Kluwer Academic Publishers, Boston, MA, 1991.
[25]
S.M. LaValle, J.H. Yakey, and L.E. Kavraki. A probabilistic roadmap approach for systems with closed kinematic chains. In Proc. IEEE Int. Conf. Robot. Aurora. (ICRA), 1999.
[26]
M. Levitt. Protein folding by restrained energy minimization and molecular dynamics. J. Mol. Biol., 170:723-764, 1983.
[27]
M. Levitt, M. Gerstein, E. Huang, S. Subbiah, and J. Tsai. Protein folding: the endgame. Annu. Rev. Biochem., 66:549-579, 1997.
[28]
M. Levitt and A. Warshel. Computer simulation of protein folding. Nature, 253:694-698, 1975.
[29]
R. Li and C. Woodward. The hydrogen exchange core and protein folding. Protein Science, 8:1571-1591, 1999.
[30]
L. Lu and S. Akella. Folding cartons with fixtures: A motion planning approach. In Proc. IEEE Int. Conf. Robot. Autom. (ICRA), pages 1570-1576, 1999.
[31]
C.R. Matthews. Pathways of protein folding. Annu. Rev. Biochem., 62:653-683, 1993.
[32]
V. Mufioz and W.A. Eaton. A simple model for calculating the kinetics of protein folding from three dimensional structures. Proc. Natl. Acad. Sci. USA, 96:11311-11316, 1999.
[33]
J. O'Rourke. Folding and unfolding in computational geometry. In Proc. Japan Conf. Discrete Comput. Geom. '98, pages 142-147, December 1998. Revised version submitted to LLNCS.
[34]
G.N. Ramachandran and V. Sasisekharan. Conformation of polypeptides and proteins. Adv. Prot. Chem., 28:283-437, 1968.
[35]
E.I. Shakhnovich. Theoretical studies of protein-folding thermodynamics and kinetics. Curt. Op. Str. Bio., 7:29-40, 1997.
[36]
A.P. Singh, J.C. Latombe, and D.L. Brutlag. A motion planning approach to flexible ligand binding. In 7th Int. Conf. on Intelligent Systems for Molecular Biology (ISMB), pages 252-261, 1999.
[37]
G. Song and N. M. Amato. Motion planning approach to folding: From paper craft to protein structure prediction. Technical Report TR00-001, Department of Computer Science, Texas A&M University, January 2000.
[38]
M. J. Sternberg. Protein Structure Prediction. OIRL Press at Oxford University Press, 1996.
[39]
S. Sun. Reduced representation model of protein structure prediction: statistical potential and genetic algorithms. Protein Sci., 2:762-785, 1993.
[40]
S. Sun, P.D. Thomas, and K.A. Dill. A simple protein folding algorithm using a binary code and secondary structure constraints. Protein Eng., 8:769-778, 1995.
[41]
S. A. Wilmarth, N. M. Amato, and P. F. Stiller. MAPRM: A probabilistic roadmap planner with sampling on the medial axis of the free space. In Proc. IEEE Int. Conf. Robot. Autom. (ICRA), pages 1024-1031, 1999.

Cited By

View all
  • (2019)Fast and Optimal Path Planning Algorithm (FAOPPA) for a Mobile RobotWireless Personal Communications: An International Journal10.1007/s11277-019-06180-w106:2(577-592)Online publication date: 1-May-2019
  • (2014)Molecular tetrisProceedings of the Seventh International Conference on Motion in Games10.1145/2668084.2668086(133-138)Online publication date: 6-Nov-2014
  • (2014)Molecular tetrisProceedings of the 7th International Conference on Motion in Games10.1145/2668064.2668086(133-138)Online publication date: 6-Nov-2014
  • Show More Cited By

Index Terms

  1. Using motion planning to study protein folding pathways

        Recommendations

        Comments

        Information & Contributors

        Information

        Published In

        cover image ACM Conferences
        RECOMB '01: Proceedings of the fifth annual international conference on Computational biology
        April 2001
        316 pages
        ISBN:1581133537
        DOI:10.1145/369133
        • Chairman:
        • Thomas Lengauer
        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Sponsors

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        Published: 22 April 2001

        Permissions

        Request permissions for this article.

        Check for updates

        Qualifiers

        • Article

        Conference

        RECOMB01
        Sponsor:

        Acceptance Rates

        RECOMB '01 Paper Acceptance Rate 35 of 128 submissions, 27%;
        Overall Acceptance Rate 148 of 538 submissions, 28%

        Contributors

        Other Metrics

        Bibliometrics & Citations

        Bibliometrics

        Article Metrics

        • Downloads (Last 12 months)13
        • Downloads (Last 6 weeks)2
        Reflects downloads up to 21 Sep 2024

        Other Metrics

        Citations

        Cited By

        View all
        • (2019)Fast and Optimal Path Planning Algorithm (FAOPPA) for a Mobile RobotWireless Personal Communications: An International Journal10.1007/s11277-019-06180-w106:2(577-592)Online publication date: 1-May-2019
        • (2014)Molecular tetrisProceedings of the Seventh International Conference on Motion in Games10.1145/2668084.2668086(133-138)Online publication date: 6-Nov-2014
        • (2014)Molecular tetrisProceedings of the 7th International Conference on Motion in Games10.1145/2668064.2668086(133-138)Online publication date: 6-Nov-2014
        • (2014)Improving decoy databases for protein folding algorithmsProceedings of the 5th ACM Conference on Bioinformatics, Computational Biology, and Health Informatics10.1145/2649387.2660839(717-724)Online publication date: 20-Sep-2014
        • (2012)A multi-directional rapidly exploring random graph (mRRG) for protein foldingProceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine10.1145/2382936.2382942(44-51)Online publication date: 7-Oct-2012
        • (2009)Feasibility of Motion Planning on Directed GraphsProceedings of the 6th Annual Conference on Theory and Applications of Models of Computation10.1007/978-3-642-02017-9_45(430-439)Online publication date: 12-May-2009
        • (2008)Dexterous Manipulation of Origami Cartons With Robotic Fingers Based on the Interactive Configuration SpaceJournal of Mechanical Design10.1115/1.2813783130:2(022303)Online publication date: 2008
        • (2008)Incremental Map Generation (IMG)Algorithmic Foundation of Robotics VII10.1007/978-3-540-68405-3_4(53-68)Online publication date: 2008
        • (2007)Using Stochastic Roadmap Simulation to Predict Experimental Quantities in Protein Folding Kinetics: Folding Rates and Phi-ValuesJournal of Computational Biology10.1089/cmb.2007.R00414:5(578-593)Online publication date: Jun-2007
        • (2006)Algorithmic motion planningGeneral Theory of Information Transfer and Combinatorics10.5555/2168005.2168059(740-768)Online publication date: 1-Jan-2006
        • Show More Cited By

        View Options

        Get Access

        Login options

        View options

        PDF

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        Media

        Figures

        Other

        Tables

        Share

        Share

        Share this Publication link

        Share on social media