A motion-planning approach to folding: from paper craft to protein folding

In this paper, we present a framework for studying folding problems from a motion-planning perspective. The version of the motion-planning problem we consider is that of determining a sequence of motions to transform some configuration of a foldable object (the start) into another configuration (the goal). Modeling foldable objects as tree-like multilink objects allows us to apply motion-planning techniques for articulated objects with many degrees of freedom (many links) to folding problems. An important feature of this approach is that it not only allows us to study foldability questions, such as, can one object be folded (or unfolded) into another object, but it also provides us with another tool for investigating the dynamic folding process itself. The framework proposed here has application to traditional motion-planning areas such as automation and animation, to paper-folding problems studied in computational geometry, and to computational biology problems such as protein folding. Preliminary experimental results with paper folding and the folding of small proteins (approximately 60 residues) are quite encouraging.

[1]  C. Anfinsen.  Principles that govern the folding of protein chains. , 1973, Science.

[2]  M. Levitt,et al.  Computer simulation of protein folding , 1975, Nature.

[3]  G. C. Shephard.  Convex polytopes with convex nets , 1975, Mathematical Proceedings of the Cambridge Philosophical Society.

[4]  M. Levitt.  Protein folding by restrained energy minimization and molecular dynamics. , 1983, Journal of molecular biology.

[5]  John J. Craig,et al.  Introduction to Robotics Mechanics and Control , 1986 .

[6]  Jr. George N. Reeke.  Protein folding: computational approaches to an exponential-time problem , 1988 .

[7]  John J. Craig,et al.  Introduction to robotics - mechanics and control (2. ed.) , 1989 .

[8]  J. M. Haile,et al.  Molecular dynamics simulation : elementary methods / J.M. Haile , 1992 .

[9]  D. Covell.  Folding protein α‐carbon chains into compact forms by monte carlo methods , 1992 .

[10]  M. Levitt,et al.  Realistic simulations of native-protein dynamics in solution and beyond. , 1993, Annual review of biophysics and biomolecular structure.

[11]  Matthews Cr.  PATHWAYS OF PROTEIN FOLDING , 1993 .

[12]  S. Sun,et al.  Reduced representation model of protein structure prediction: Statistical potential and genetic algorithms , 1993, Protein science : a publication of the Protein Society.

[13]  A. Gronenborn,et al.  Fast folding of a prototypic polypeptide: The immunoglobulin binding domain of streptococcal protein G , 1994, Protein science : a publication of the Protein Society.

[14]  J. Skolnick,et al.  Monte carlo simulations of protein folding. I. Lattice model and interaction scheme , 1994, Proteins.

[15]  Moshe Shpitalni,et al.  Automatic Determination of Bending Sequence in Sheet Metal Products , 1994 .

[16]  H.J.J. Kals,et al.  The generation of bending sequences in a CAPP system for sheet-metal components , 1994 .

[17]  Dinesh Manocha,et al.  Kinematic Manipulation of Molecular Chains Subject to Rigid Constraint , 1994, ISMB.

[18]  D. Eisenberg,et al.  An evolutionary approach to folding small alpha-helical proteins that uses sequence information and an empirical guiding fitness function. , 1994, Proceedings of the National Academy of Sciences of the United States of America.

[19]  Thomas G. Dietterich,et al.  Compass: A shape-based machine learning tool for drug design , 1994, J. Comput. Aided Mol. Des..

[20]  John F. Canny,et al.  Geometric Problems in Molecular Biology and Robotics , 1994, ISMB.

[21]  Sue Whitesides,et al.  Reconfiguring closed polygonal chains in Euclideand-space , 1995, Discret. Comput. Geom..

[22]  Lydia E. Kavraki,et al.  Random networks in configuration space for fast path planning , 1994 .

[23]  Dinesh Manocha,et al.  Conformational analysis of molecular chains using nano-kinematics , 1995, Comput. Appl. Biosci..

[24]  K. Dill,et al.  A simple protein folding algorithm using a binary code and secondary structure constraints. , 1995, Protein engineering.

[25]  Dinesh Manocha,et al.  OBBTree: a hierarchical structure for rapid interference detection , 1996, SIGGRAPH.

[26]  B. Faverjon,et al.  Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .

[27]  Lydia E. Kavraki,et al.  Geometry and the Discovery of New Ligands , 1996 .

[28]  H. Dyson,et al.  Absence of a stable intermediate on the folding pathway of protein A , 1997, Protein science : a publication of the Protein Society.

[29]  V. Muñoz,et al.  Submillisecond kinetics of protein folding. , 1997, Current opinion in structural biology.

[30]  M. Levitt,et al.  Protein folding: the endgame. , 1997, Annual review of biochemistry.

[31]  Satyandra K. Gupta,et al.  Automated process planning for sheet metal bending operations , 1998 .

[32]  Lydia E. Kavraki,et al.  On finding narrow passages with probabilistic roadmap planners , 1998 .

[33]  Joseph O'Rourke,et al.  Folding and Unfolding in Computational Geometry , 1998, JCDCG.

[34]  P. Kollman,et al.  Pathways to a protein folding intermediate observed in a 1-microsecond simulation in aqueous solution. , 1998, Science.

[35]  Jason H. Cantarella,et al.  NONTRIVIAL EMBEDDINGS OF POLYGONAL INTERVALS AND UNKNOTS IN 3-SPACE , 1998 .

[36]  Erik D. Demaine,et al.  Unfolding some classes of orthogonal polyhedra , 1998, CCCG.

[37]  Daniel Vallejo,et al.  OBPRM: an obstacle-based PRM for 3D workspaces , 1998 .

[38]  C. S. Wang,et al.  AmbiPack: A systematic algorithm for packing of macromolecular structures with ambiguous distance constraints , 1998, Proteins.

[39]  Mark H. Overmars,et al.  The Gaussian sampling strategy for probabilistic roadmap planners , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[40]  Joseph S. B. Mitchell,et al.  Folding flat silhouettes and wrapping polyhedral packages: new results in computational origami , 1999, SCG '99.

[41]  J. O'Rourke,et al.  When Can a Polygon Fold to a Polytope , 1999 .

[42]  Joseph O'Rourke,et al.  Polygonal chains cannot lock in 4d , 1999, CCCG.

[43]  P. Lansbury.  Evolution of amyloid: what normal protein folding may tell us about fibrillogenesis and disease. , 1999, Proceedings of the National Academy of Sciences of the United States of America.

[44]  Lydia E. Kavraki,et al.  A probabilistic roadmap approach for systems with closed kinematic chains , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[45]  Jean-Claude Latombe,et al.  A Motion Planning Approach to Flexible Ligand Binding , 1999, ISMB.

[46]  R. Li,et al.  The hydrogen exchange core and protein folding , 1999, Protein science : a publication of the Protein Society.

[47]  Erik D. Demaine,et al.  Locked and unlocked polygonal chains in 3D , 1998, SODA '99.

[48]  Nancy M. Amato,et al.  MAPRM: a probabilistic roadmap planner with sampling on the medial axis of the free space , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[49]  V. Muñoz,et al.  A simple model for calculating the kinetics of protein folding from three-dimensional structures. , 1999, Proceedings of the National Academy of Sciences of the United States of America.

[50]  E. Alm,et al.  Prediction of protein-folding mechanisms from free-energy landscapes derived from native structures. , 1999, Proceedings of the National Academy of Sciences of the United States of America.

[51]  Liang Lu,et al.  Folding cartons with fixtures: a motion planning approach , 1999, IEEE Trans. Robotics Autom..

[52]  Nancy M. Amato,et al.  Ligand Binding with OBPRM and Haptic User Input: Enhancing Automatic Motion Planning with Virtual Touch , 2000 .

[53]  Nancy M. Amato,et al.  A Kinematics-Based Probabilistic Roadmap Method for Closed Chain Systems , 2001 .

[54]  Nancy M. Amato,et al.  A Motion Planning Approach to Folding: From Paper Craft to Protein Structure Prediction , 2000 .

[55]  T. N. Bhat,et al.  The Protein Data Bank , 2000, Nucleic Acids Res..

[56]  D. Baker,et al.  A surprising simplicity to protein folding , 2000, Nature.

[57]  Nancy M. Amato,et al.  A motion planning approach to folding: from paper craft to protein folding , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[58]  Nancy M. Amato,et al.  Ligand binding with OBPRM and user input , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[59]  Jean-Claude Latombe,et al.  Capturing molecular energy landscapes with probabilistic conformational roadmaps , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[60]  Nancy M. Amato,et al.  Using motion planning to study protein folding pathways , 2001, J. Comput. Biol..

[61]  J. Jung,et al.  Protein structure prediction. , 2001, Current opinion in chemical biology.

[62]  Lydia E. Kavraki,et al.  Randomized path planning for linkages with closed kinematic chains , 2001, IEEE Trans. Robotics Autom..

[63]  Chris Bailey-Kellogg,et al.  Physical geometric algorithms for structural molecular biology , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[64]  Lydia E. Kavraki,et al.  A dimensionality reduction approach to modeling protein flexibility , 2002, RECOMB '02.

[65]  Nancy M. Amato,et al.  Using motion planning to map protein folding landscapes and analyze folding kinetics of known native structures , 2002, RECOMB '02.

[66]  Ming Zhang,et al.  A New Method for Fast and Accurate Derivation of Molecular Conformations , 2002, J. Chem. Inf. Comput. Sci..

[67]  G. Chirikjian,et al.  Efficient generation of feasible pathways for protein conformational transitions. , 2002, Biophysical journal.

[68]  Jean-Claude Latombe,et al.  Stochastic roadmap simulation: an efficient representation and algorithm for analyzing molecular motion , 2002, RECOMB '02.

[69]  Nancy M. Amato,et al.  Using Motion Planning to Study Protein Folding Pathways , 2002, J. Comput. Biol..

[70]  J. Skolnick.  Monte Carlo Simulations of Protein Folding , 2003 .