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

IEEE Transactions on Robotics and Automation

Volumn 20, Issue 1, 2004, Pages 60-71

  Song, Guang ^a   Amato, Nancy M ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

Folding pathways; Motion planning; Paper folding; Probabilistic roadmap methods; Protein folding

Indexed keywords

ANIMATION; AUTOMATION; COMPUTATIONAL GEOMETRY; DEGREES OF FREEDOM (MECHANICS); PACKAGING; ROBOTICS;

PAPER CRAFT; PAPER FOLDING; POLYHEDRON; PROBABILISTIC ROADMAP METHODS;

MOTION PLANNING;

EID: 1542316184     PISSN: 1042296X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TRA.2003.820926     Document Type: Article

References (64)

1. J. Akiyama, "Why taro can do geometry," in Proc. 9th Canadian Conf. Computational Geometry, 1997, p. 112.
2. E. Alm and D. Baker, "Prediction of protein-folding mechanisms from free-energy landscapes derived from native structures," Proc. Nat. Acad. Sci., vol. 96, no. 20, pp. 11305-11310, 1999.
3. N. M. Amato, O. B. Bayazit, L. K. Dale, C. V. Jone, and D. Vallejo, "OBPRM: An obstacle-based PRM for 3-D workspaces," in Robotics: The Algorithmic Perspective. Natick, MA: A. K. Peters, 1998, pp. 155-168.
4. N. M. Amato, K. A. Dill, and G. Song, "Using motion planning to map protein-folding landscapes and analyze folding kinetics of known native structures," in Proc. Int. Conf. Computational Molecular Biology (RECOMB), 2002, pp. 2-11.
5. N. M. Amato and G. Song, "Using motion planning to study protein folding pathways," in J. Comput. Biol., vol. 9, 2002, pp. 149-168.
6. C. B. Anfinsen, "Principles that govern the folding of protein chains," Science, vol. 181, pp. 223-230, 1973.
7. M. S. Apaydin, D. L. Brutlag, C. Guestrin, D. Hsu, and J.-C. Latombe, "Stochastic roadmap simulation: An efficient representation and algorithm for analyzing molecular motion," in Proc. Int. Conf. Computational Molecular Biology (RECOMB), 2002, pp. 12-21.
8. 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. Robotics and Automation (ICRA), 2001, pp. 932-939.
9. Y. Bai, A. Karimi, H. J. Dyson, and P. E. Wright, "Absence of a stable intermediate on the folding pathway of protein A," Protein Sci., vol. 6, no. 7, pp. 1449-1457, 1997.
10. C. Bailey-Kellogg, J. Kelley, R. Lilien, and B. Donald, "Physical geometric algorithms for structural molecular biology," in Proc. IEEE Int. Conf. Robotics and Automation (ICRA), 2001, pp. 940-947.
11. D. Baker, "A surprising simplicity to protein folding," Nature, vol. 405, 39-42, 2000.
12. O. B. Bayazit, G. Song, and N. M. Amato, "Ligand binding with OBPRM and haptic user input: Enhancing automatic motion planning with virtual touch," in Proc. IEEE Int. Conf. Robotics and Automation (ICRA), 2001, pp. 954-959.
13. H. M. Berman, J. Westbrook, Z. Feng, G. Gilliland, T. N. Bhat, H. Weissig, I. N. Shindyalov, and P. E. Bourne, "The protein data bank," Nucleic Acids Res., vol. 28, no. 1, pp. 235-242. 2000.
14. 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 Symp. Discrete Algorithms, Jan. 1999, pp. 66-867.
15. T. Biedl, E. Demaine, M. Demaine, A. Lubiw, J. O'Rourke, M. Overmars, S. Robbins, and S. Whitesides, "Unfolding some classes of orthogonal polyhedra," in Proc. 10th Canadian Conf. Computational Geometry, 1998, pp. 70-71.
16. V. Boor, M. H. Overmars, and A. F. van der Stappen, "The Gaussian sampling strategy for probabilistic roadmap planners," in Proc. IEEE Int. Conf. Robotics and Automation (ICRA), 1999, pp. 1018-1023.
17. J. U. Bowie and D. Eisenberg, "An evolutionary approach to folding small α-helical proteins that uses sequence information and an empirical guiding fitness function," Proc. Nat. Acad. Sci., vol. 91, no. 10, pp. 4436-4440, 1994.
18. J. Cantarella and H. Johnston, "Nontrivial embeddings of polygonal intervals and unknots in 3-space," J. Knot Theory Ramifications, vol. 7, pp. 1027-1039, 1998.
19. R. Cocan, and J. O'Rourke, "Polygonal chains cannot lock in 4D," in Proc. 11th Canadian Conf. Computational Geometry, 1999, pp. 5-8.
20. D. G. Covell, "Folding protein α-carbon chains into compact forms by Monte Carlo methods," Proteins: Struct. Funct. Genet., vol. 14, no. 4, pp. 409-420, 1992.
21. J. J. Craig, Introduction to Robotics: Mechanics and Control, 2nd ed. Reading, MA: Addison-Wesley, 1989.
22. V. Daggett and M. Levitt, "Realistic simulation of naive-protein dynamics in solution and beyond," Annu. Rev. Biophys. Biomol. Struct., vol. 22, pp. 353-380, 1993.
23. L. J. de Vin, A. H. Streppel, E. J. W. Klaassen, and H. J. J. Kals, "The generation of bending sequencies in a CAPP system for sheet-metal components," J. Mater. Processing Technol., vol. 41, no. 3, pp. 331-339, 1994.
24. E. D. Demaine, M. L , Demaine, and J. S. B. Mitchell, "Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami," Comput. Geom: Theory Applicat., vol. 16, no. 1, pp. 3-21, 2000.
25. Y. Duan and P. A. Kollman, "Pathways to a protein folding intermediate observed in a 1-microsecond simulation in aqueous solution," Science, vol. 282, pp. 740-744, 1998.
26. S. Gottschalk, M. C. Lin, and D. Manocha, "Obb-Tree: A Hierarchical Structure for Rapid Interference Detection," Univ. NC, Chapel Hill, NC, Tech. Rep. TR 96-013, 1996.
27. S. K. Gupta, D. A. Bourne, K. H. Kim, and S. S. Krishnan, "Automated process planning for sheet metal bending operations," J. Manuf. Syst., vol. 17, no. 5, pp. 338-360, 1998.
28. J. M. Haile, Molecular Dynamics Simulation: Elementary Methods. New York: Wiley, 1992.
29. L. Han and N. M. Amato, "A kinematics-based probabilistic roadmap method for closed-chain systems," in Robotics: New Directions. Natick, MA: A. K. Peters, 2000, pp. 233-246.
30. D. Hsu, L. Kavraki, J.-C. Latombe, R. Motwani, and S. Sorkin, "On finding narrow passages with probabilistic roadmap planners," presented at the Int. Workshop Algorithmic Foundations of Robotics (WAFR), 1998.
31. A. Jain, T. G. Dietterich, R. H. Lathrop, D. E. Chapman, R. E. Critchlow, B. E. Bauer, T. A. Webster, and T. Lozano-Perez, "Compass: A shape-based machine learning tool for drug design," J. Comput.-Aided Molecular Des., vol. 8, pp. 635-652, 1994.
32. L. Kavraki, "Random networks in configuration space for fast path planning," Ph.D. dissertation, Stanford Univ., Comput. Sci. Dept., Stanford, CA, 1995.
33. L. Kavraki, P. Svestka, J. C. Latombe, and M. Overmars, "Probabilistic roadmaps for path planning in high-dimensional configuration spaces," IEEE Trans. Robot. Automat., vol. 12, pp. 566-580, Aug. 1996.
34. M. K. Kim, R. L. Jernigan, and G. S. Chirikjian, "Efficient generation of feasible pathways for protein conformational transitions," Biophys. J., vol. 83, no. 3, pp. 1620-1630, 2002.
35. A. Kolinski and J. Skolnick, "Monte Carlo simulations of protein folding," Proteins Struct. Funct. Genet., vol. 18, no. 3, pp. 338-352, 1994.
36. J. Kuszewski, G. M. Clore, and A. M. Gronenborn, "Fasting folding of a prototypic polypeptide: The immunoglobulin binding domain of streptococcal protein G," Protein Sci., vol. 3, pp. 1945-1952, 1994.
37. P. T. Lansbury, "Evolution of amyloid: What normal protein folding may tell us about fibrillogenesis and disease," Proc. Nat. Acad. Sci., vol. 96, no. 7, pp. 3342-3344, 1999.
38. 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. Robotics and Automation (ICRA), vol. 3, May 1999, pp. 1671-1676.
39. W. J. Lenhart and S. H. Whitesides, "Reconfiguring closed polygonal chains in Euclidean d-space," Discrete Comput. Geom., vol. 13, pp. 123-140, 1995.
40. M. Levitt, "Protein folding by restrained energy minimization and molecular dynamics," J. Mol. Biol., vol. 170, pp. 723-764, 1983.
41. M. Levitt and A. Warshel, "Computer simulation of protein folding," Nature, vol. 253, pp. 694-698, 1975.
42. R. Li and C. Woodward, "The hydrogen exchange core and protein folding," Protein Sci., vol. 8, no. 8, pp. 1571-1591, 1999.
43. L. Lu and S. Akella, "Folding cartons with fixtures: A motion-planning approach," IEEE Trans. Robot. Automat., vol. 16, pp. 346-356, Aug. 2000.
44. A. Lubiw and J. O'Rourke, "When can a polygon fold to a polytope?," presented at the AMS Conf., Tech. Rep. 048, June 1996.
45. D. Manocha and Y. Zhu, "Kinematic manipulation of molecular chains subject to rigid constraints," in Int. Conf. Intelligent Systems for Molecular Biology (ISMB), 1994, pp. 285-294.
46. D. Monacha, Y. Zhu, and W. Wright, "Conformational analysis of molecular chains using nano-kinematics," Comput. Applicat. Biol. Sci., vol. 11, no. 1, pp. 71-86, 1995.
47. C. R. Matthews, "Pathways of protein folding," Annu. Rev. Biochem., vol. 62, pp. 653-683, 1993.
48. V. Muñoz and W. A. Eaton, "A simple model for calculating the kinetics of protein folding from three-dimensional structures," Proc. Nat. Acad. Sci., vol. 96, no. 20, pp. 11 311-11 316, 1999.
49. J. O'Rourke, "Folding and unfolding in computational geometry," in Proc. Japan Conf. Discrete Computational Geom., Dec. 1998, pp. 142-147.
50. D. Parsons and J. Canny, "Geometric problems in molecular biology and robotics," in Int. Conf. Intelligent Systems for Molecular Biology (ISMB), 1994, pp. 322-330.
51. G. N. Reeke, Jr., "Protein folding: Computational approaches to an exponential-time problem," Annu. Rev. Comput. Sci., vol. 3, pp. 59-84, 1988.
52. G. C. Shephard, "Convex polytopes with convex nets," Math. Proc. Cambridge Phil. Soc., vol. 78, pp. 389-403, 1975.
53. M. Shpitalni and D. Saddan, "Automatic determination of bending sequence in sheet metal products," Ann. CIRP, vol. 43, pp. 23-26, 1994.
54. A. P. Singh, J. C. Latombe, and D. L. Brutlag, "A motion planning approach to flexible ligand binding," in 7th Int. Conf. Intelligent Systems for Molecular Biology (ISMB), 1999, pp. 252-261.
55. G. Song and N. M. Amato, "A motion planning approach to folding: From paper craft to protein structure prediction," Dept. Comput. Sci., Texas A&M Univ., College Station, TX, Tech. Rep. TR 00-001, Jan. 2000.
56. ____, "A motion-planning approach to folding: From paper craft to protein folding," in Proc. IEEE Int. Conf. Robotics and Automation (ICRA), 2001, pp. 948-853.
57. M. J. Sternberg, Protein Structure Prediction. Cambridge, U.K.: OIRL Press/Oxford Univ. Press, 1996.
58. S. Sun, "Reduced representation model of protein structure prediction: Statistical potential and genetic algorithms," Protein Sci., vol. 2, no. 5, pp. 762-785, 1993.
59. S. Sun, P.D. Thomas, and K. A. Dill, "A simple protein folding algorithm using a binary code and secondary structure constraints," Protein Eng., vol. 8, no. 8, pp. 769-778, 1995.
60. M. L. Teodoro, G. N. Phillips, Jr., and L. E. Kavraki, "A dimensionality reduction approach to modeling protein flexibility," in Proc. Int. Conf. Computational Molecular Biology (RECOMB), 2002, pp. 299-308.
61. E. Wang, T. Lozano-Perez, and B. Tidor, "Ambipack: A systematic algorithm for packing of rigid macromolecular structures with ambiguous constraints," Proteins: Struct., Funct., Genet., vol. 32, no. 1, pp. 26-42, 1998.
62. 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. Robotics and Automation (ICRA), 1999, pp. 1024-1031.
63. J. H. Yakey, S. M. LaValle, and L. E. Kavraki, "Randomized path planning for linkages with closed kinematic chains," IEEE Trans. Robot. Automat., vol. 17, pp. 951-958, Dec. 2001.
64. M. Zhang and L. E. Kavraki, "A new method for fast and accurate computation of molecular conformations," J. Chem. Inform. Comput. Sci., vol. 42, no. 1, pp. 64-70, 2002.