logging in or signing up wuzj05 05 26 Heather Download Post to : URL : Related Presentations : Share Add to Flag Embed Email Send to Blogs and Networks Add to Channel Uploaded from authorPOINTLite Insert YouTube videos in PowerPont slides with aS Desktop Copy embed code: (To copy code, click on the text box) Embed: URL: Thumbnail: WordPress Embed Customize Embed The presentation is successfully added In Your Favorites. Views: 12 Category: Entertainment License: All Rights Reserved Like it (0) Dislike it (0) Added: October 16, 2007 This Presentation is Public Favorites: 0 Presentation Description No description available. Comments Posting comment... Premium member Presentation Transcript Slide1: Zhijun Wu Department of Mathematics Program on Bio-informatics and Computational Biology Iowa State University Ames, Iowa Protein Structure and DynamicsSlide2: Protein Folding GLU GLU ASN VAL LEU ARG PRO ASN ALA GLN . . . GLU VAL GLU ASN GLN ALA ASN PRO ARG LEUSlide3: Prion, Stanley B. Prusiner, 1997, Nobel Prize in Physiology and Medicine Myoglobin, John Kendrew, 1962, Nobel Prize in Chemistry Photosynthetic Reaction Center, Johann Deisenhofer, 1988, Nobel Prize in ChemistrySlide4: Experimental Methods X-ray Crystallography NMR SpectroscopySlide5: Holdings in the PDB Protein Data Bank http://www.rcsb.orgSlide6: Physical PropertiesSlide7: Initial-Value Problem Mathematical ModelSlide8: Numerical Solutions t x tk tk+1 xk xk+1 x(t) Verlet 1967Slide9: 10-15 femto 10-12 pico 10-9 nano 10-6 micro 10-3 milli 100 seconds Bond vibration Isomeris- ation Water dynamics Helix forms Fastest folders Typical folders Slow folders Time Scales for Protein MotionSlide10: Folding of Villin Headpiece Subdomain (HP-36) Duan and Kollman 1998Slide11: Boundary-Value Formulation Alternative Approaches Ron Elber 1996Slide12: Single Shooting t x t=0 t=1 x0 x1 x1 v0 v0 x1 = ψ(v0) φ(v0)= ψ(v0)-x1 φ(v0)= 0 Newton’s MethodSlide13: Multiple Shooting t x t=0 t=m x0 xm (xj-1,vj-1) φj(xj-1, vj-1, xj) = ψj(xj-1, vj-1) - xj φj( xj-1, vj-1, xj) = 0 j = 1, …, m Newton’s Method ψj (Vedell and Wu 2005)Slide14: Alternative Approaches min E (x1, x2, … , xn) Energy Minimization Scheraga, et al.Slide15: Energy Landscape Peter Wolynes, et al.Slide16: Energy Transformation Scheraga et al. 1989, Shalloway 1992, Straub 1996 Slide17: Transformation Theory Wu 1996, More & Wu 1997 High frequency components are reduced with increasing λ values.Slide18: Having puzzled the scientists for decades, the protein folding problem remains a grand challenge of modern science. The protein folding problem may be studied through MD simulation under certain boundary conditions. An efficient optimization algorithm may be developed to obtain a fast fold by exploiting the special structure of protein energy landscape. The successful simulation of protein folding requires correct physics, efficient and accurate algorithms, and sufficient computing power. You do not have the permission to view this presentation. In order to view it, please contact the author of the presentation.
wuzj05 05 26 Heather Download Post to : URL : Related Presentations : Share Add to Flag Embed Email Send to Blogs and Networks Add to Channel Uploaded from authorPOINTLite Insert YouTube videos in PowerPont slides with aS Desktop Copy embed code: (To copy code, click on the text box) Embed: URL: Thumbnail: WordPress Embed Customize Embed The presentation is successfully added In Your Favorites. Views: 12 Category: Entertainment License: All Rights Reserved Like it (0) Dislike it (0) Added: October 16, 2007 This Presentation is Public Favorites: 0 Presentation Description No description available. Comments Posting comment... Premium member Presentation Transcript Slide1: Zhijun Wu Department of Mathematics Program on Bio-informatics and Computational Biology Iowa State University Ames, Iowa Protein Structure and DynamicsSlide2: Protein Folding GLU GLU ASN VAL LEU ARG PRO ASN ALA GLN . . . GLU VAL GLU ASN GLN ALA ASN PRO ARG LEUSlide3: Prion, Stanley B. Prusiner, 1997, Nobel Prize in Physiology and Medicine Myoglobin, John Kendrew, 1962, Nobel Prize in Chemistry Photosynthetic Reaction Center, Johann Deisenhofer, 1988, Nobel Prize in ChemistrySlide4: Experimental Methods X-ray Crystallography NMR SpectroscopySlide5: Holdings in the PDB Protein Data Bank http://www.rcsb.orgSlide6: Physical PropertiesSlide7: Initial-Value Problem Mathematical ModelSlide8: Numerical Solutions t x tk tk+1 xk xk+1 x(t) Verlet 1967Slide9: 10-15 femto 10-12 pico 10-9 nano 10-6 micro 10-3 milli 100 seconds Bond vibration Isomeris- ation Water dynamics Helix forms Fastest folders Typical folders Slow folders Time Scales for Protein MotionSlide10: Folding of Villin Headpiece Subdomain (HP-36) Duan and Kollman 1998Slide11: Boundary-Value Formulation Alternative Approaches Ron Elber 1996Slide12: Single Shooting t x t=0 t=1 x0 x1 x1 v0 v0 x1 = ψ(v0) φ(v0)= ψ(v0)-x1 φ(v0)= 0 Newton’s MethodSlide13: Multiple Shooting t x t=0 t=m x0 xm (xj-1,vj-1) φj(xj-1, vj-1, xj) = ψj(xj-1, vj-1) - xj φj( xj-1, vj-1, xj) = 0 j = 1, …, m Newton’s Method ψj (Vedell and Wu 2005)Slide14: Alternative Approaches min E (x1, x2, … , xn) Energy Minimization Scheraga, et al.Slide15: Energy Landscape Peter Wolynes, et al.Slide16: Energy Transformation Scheraga et al. 1989, Shalloway 1992, Straub 1996 Slide17: Transformation Theory Wu 1996, More & Wu 1997 High frequency components are reduced with increasing λ values.Slide18: Having puzzled the scientists for decades, the protein folding problem remains a grand challenge of modern science. The protein folding problem may be studied through MD simulation under certain boundary conditions. An efficient optimization algorithm may be developed to obtain a fast fold by exploiting the special structure of protein energy landscape. The successful simulation of protein folding requires correct physics, efficient and accurate algorithms, and sufficient computing power.