Parallel protein folding with STAPL

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)

Volumn 18, Issue , 2004, Pages 2639-2646

  Thomas, Shawna ^a   Amato, Nancy M ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PARALLEL MOTION PLANNING; PROBABILISTIC ROADMAP METHOD (PRM); PROTEIN FOLDING; STANDARD TEMPLATE ADAPTIVE PARALLEL LIBRARY (STAPL);

APPROXIMATION THEORY; COMPUTER SIMULATION; DISEASE CONTROL; GRAPH THEORY; MOLECULAR DYNAMICS; MONTE CARLO METHODS; POTENTIAL ENERGY; PROBABILITY;

PROTEINS;

EID: 12444336907     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (39)

1. E. Alm and D. Baker. Prediction of protein-folding mechanisms from free-energy landscapes derived from native structures. Proc. Natl. Acad. Sci. USA, 96(20):11305-11310, 1999.
2. N. M. Amato and L. K. Dale. Probabilistic roadmap methods are embarrassingly parallel. In Proc. IEEE Int. Conf. Robot. Autom. (ICRA), pages 688-694, 1999.
3. 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. J. Comput. Biol., 2003. To appear. Special issue of Int. Conf. Comput. Molecular Biology (RECOMB) 2002.
4. N. M. Amato and G. Song. Using motion planning to study protein folding pathways. J. Comput. Biol., 9(2):149-168, 2002. Special issue of Int. Conf. Comput. Molecular Biology (RECOMB) 2001.
5. P. An, A. Jula, S. Rus, S. Saunders, T. Smith, G. Tanase, N. Thomas, N. Amato, and L. Rauchwerger. STAPL: An adaptive, generic parallel programming library for C++. In Proc. of the 14th International Workshop on Languages and Compilers for Parallel Computing (LCPC), Cumberland Falls, Kentucky, Aug 2001.
6. M. Apaydin, D. 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. Comput. Molecular Biology (RECOMB), pages 12-21, 2002.
7. M. Apaydin, A. Singh, D. Brutlag, and J.-C. Latombe. Capturing molecular energy landscapes with probabilistic conformational roadmaps. In Proc. IEEE Int. Conf. Robot. Autom. (ICRA), pages 932-939, 2001.
8. D. Baker. A surprising simplicity to protein folding. Nature, 405:39-42, 2000.
9. J. Barraquand and J.-C. Latombe. Robot motion planning: A distributed representation approach. Int. J. Robot. Res., 10(6):628-649, 1991.
10. G. Blelloch. NESL: A Nested Data-Parallel Language. Technical Report CMU-CS-93-129, Carnegie Mellon University, April 1993.
11. J. Bowie and D. Eisenberg. An evolutionary approach to folding small α-helical proteins that uses sequence information and an empirical guiding fitness function. Proc. Natl. Acad. Sci. USA, 91(10):4436-4440, 1994.
12. J. Bryngelson, J. Onuchic, N. Socci, and P. Wolynes. Funnels, pathways, and the energy landscape of protein folding: A synthesis. Protein Struct. Funct. Genet, 21:167-195, 1995.
13. D. Challou, D. Boley, M. Gini, and V. Kumar. A parallel formulation of informed randomized search for robot motion planning problems. In Proc. IEEE Int. Conf. Robot. Autom. (ICRA), pages 709-714, 1995.
14. D. J. Challou, M. Gini, and V. Kumar. Parallel search algorithms for robot motion planning. In Proc. IEEE Int. Conf. Robot. Autom. (ICRA), volume 2, pages 46751, 1993.
15. D. Covell. Folding protein α-carbon chains into compact forms by Monte Carlo methods. Proteins: Struct. Funct. Genet., 14(4):409-420, 1992.
16. V. Daggett and M. Levitt. Realistic simulation of naive-protein dynamics in solution and beyond. Annu. Rev. Biophys. Biomol. Struct., 22:353-380, 1993.
17. Y. Duan and P. Kollman. Pathways to a protein folding intermediate observed in a 1-microsecond simulation in aqueous solution. Science, 282:740-744, 1998.
18. K. M. Fiebig and K. A. Dill. Protein core assembly processes. J. Chem. Phys, 98(4):3475-3487, 1993.
19. J. Haile. Molecular Dynamics Simulation: elementary methods. Wiley, New York, 1992.
20. L. Kalé, R. Skeel, M. Bhandarkar, R. Brunner, A. Gursoy, N. Krawetz, J. Phillips, A. Shinozaki, K. Varadarajan, and K. Schulten. Namd2: Greater scalability for parallel molecular dynamics. J. Comp. Phys., 151:283-312, 1999.
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(3):338-352, 1994.
23. P. Lansbury. Evolution of amyloid: What normal protein folding may tell us about fibrillogenesis and disease. Proc. Natl. Acad. Sci. USA, 96(7):3342-3344, 1999.
24. S. Larson, C. Snow, M. Shirts, and V. Pande. Foldinghome and genomehome: Using distributed computing to tackle previously intractable problems in computational biology. Computational Genomics, 2003. To appear.
25. T. Lazaridis and M. Karplus. Effective energy function for proteins in solution. Proteins, 35:133-152, 1999. http://mingus.sci.ccny.cuny.edu/server/.
26. M. Levitt. Protein folding by restrained energy minimization and molecular dynamics. J. Mol. Biol., 170:723-764, 1983.
27. M. Levitt and A. Warshel. Computer simulation of protein folding. Nature, 253:694-698, 1975.
28. R. Li and C. Woodward. The hydrogen exchange core and protein folding. Protein Sci., 8(8):1571-1591, 1999.
29. T. Lozano-Pérez. Spatial planning: A configuration space approach. IEEE Trans. Comput., C-32:108-120, 1983.
30. T. Lozano-Pérez and P. O'Donnell. Parallel robot motion planning. In Proc. IEEE Int. Conf. Robot. Autom. (ICRA), pages 1000-1007, 1991.
31. V. Muñoz, E. R. Henry, J. Hoferichter, and W. A. Eaton. A statistical mechanical model for β-hairpin kinetics. Proc. Natl. Acad. Sci. USA, 95:5872-5879, 1998.
32. D. Musser, G. Derge, and A. Saini. STL Tutorial and Reference Guide, Second Edition. Addison-Wesley, 2001.
33. L. Rauchwerger, F. Arzu, and K. Ouchi. Standard Templates Adaptive Parallel Library. In Proc. of the 4th International Workshop on Languages, Compilers and Run-Time Systems for Scalable Computers (LCR), Pittsburgh, PA, May 1998.
34. G. Song, S. Thomas, K. Dill, J. Scholtz, and N. Amato. A path planning-based study of protein folding with a case study of hairpin formation in protein G and L. In Proc. Pacific Symposium of Biocomputing (PSB), pages 240-251, 2003.
35. M. J. Sternberg. Protein Structure Prediction. OIRL Press at Oxford University Press, 1996.
36. S. Sun. Reduced representation model of protein structure prediction: statistical potential and genetic algorithms. Protein Sci., 2(5):762-785, 1993.
37. 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(8):769-778, 1995.
38. O. Tkachyshyn, P. An, G. Tanase, and N. M. Amato. parray as an efficient static parallel container in stapl. Technical Report 02-003, PARASOL Lab, Dept. of Computer Science, Texas A&M University, Aug 2003.
39. P. Weiner and P. Kollman. Amber: Assisted model building with energy renement, a general program for modeling molecules and their interactions. J. Comp. Chem., 2:287-303, 1981.