1 / 39

Part I: Paper d: Protein Folding

Part I: Paper d: Protein Folding. Erik Demaine, MIT Stefan Langerman, U. Bruxelles Joseph O’Rourke, Smith College. Outline. Interlocked Chains Fixed-angle chains Producible chains Flattenable Proof Outline Consequence?. Definitions.

mayfields
Télécharger la présentation

Part I: Paper d: Protein Folding

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Part I: Paperd: Protein Folding Erik Demaine, MIT Stefan Langerman, U. Bruxelles Joseph O’Rourke, Smith College

  2. Outline • Interlocked Chains • Fixed-angle chains • Producible chains • Flattenable • Proof Outline • Consequence?

  3. Definitions • Open vs. closed chains. (Closed chains are more constrained.) • Flexible chains: no constraints on joint motion (each joint universal). • Rigid chains: each joint is frozen, and the entire chain is rigid. • Fixed-angle chains: maintain angle between links incident to each joint.

  4. Crosstable of results

  5. Rigid 2-chains cannot interlock

  6. Flexible 2-chain can interlock with rigid 5-chain

  7. Open Problem What is the smallest value of k that permits a flexible 2-chain to interlock with a flexible k-chain? Theorem 10.1.2 shows that a rigid 5-chain suffices; presumably k > 5 is needed for a flexible chain.

  8. Demaine, Langermann, JOR:Main Theorem Theorem 1: A fixed angle polygonal (≤)-chain is -producible (  ≤ 90º ), if and only if it is flattenable.

  9. Consequence Theorem 2: The -producible configurations of chains are rare: The probability that a random configuration of a random chain is -producible approaches 0 as n∞.

  10. ProteinFolding

  11. Main Theorem Theorem 1: A fixed angle polygonal(≤)-chain is -producible (  ≤ 90º ), if and only if it is flattenable.

  12. Fixed-angle chain

  13. (≤)-chain

  14. Locked 3D Chains [Cantarella & Johnston 1998; Biedl, Demaine, Demaine, Lazard, Lubiw, O’Rourke, Overmars, Robbins, Streinu, Toussaint, Whitesides 1999] Cannot straighten some chains, even with universal joints.

  15. Ribosome http://www.biochimie.univ-montp2.fr/maitrise/ribosome/50s_letunnel.htm “The majority of the surface of the tunnel is trained by field I (yellow) and V (red) of 23S and by the nonglobular areas of the proteins L4, L22 and L39e. Incipient polypeptide first meets field V then field II and IV with the proteins L4 and L22. Half of the tunnel is constituted by field I and III and the L39e protein.”

  16. Ribosome (closeup) “The 2 proteins, L22 and L4 (in dark blue) form what appears to be an open door. This crossing point could be the place where the nature of incipient polypeptide is detected and from which information would be transmitted to the surface of ribosome, perhaps through proteins L22 and L4.”

  17. Constraint: Cone

  18. Main Theorem Theorem 1: A fixed angle polygonal (≤)-chain is -producible (  ≤ 90º ), if and only if it is flattenable.

  19. -production

  20. Lemma 1 An (≤)-chain can be produced only in a cone with (whole) apex angle of ≥ .

  21. B: Emergence cone

  22. -chain

  23. Canonical Configuration Lemma 2. If a configuration of a chain is -producible, then it can be moved inside the cone to a canonical coiled configuration, the -CCC.

  24. -CCC

  25. Proof figure

  26. Proof Idea • Replay production movements in time reversal, coiling the chain inside the cone.

  27. Main Theorem Theorem 1: A fixed angle polygonal (≤)-chain is -producible (  ≤ 90º ), if and only if it is flattenable.

  28. Flattenable A configuration of a chain if flattenable if it can be reconfigured, without self-intersection, so that it lies flat in a plane. Otherwise the configuration is unflattenable, or locked.

  29. Every 90º-angle chain has a flattenable configuration.

  30. Unflattenable chain

  31. Main Theorem (revisited) Theorem 1: All -producible (≤)-chains are flattenable, provided  ≤ 90º. All flat configurations of (≤)-chains are -producible, for  ≤ 90º.

  32. Logical Flow of Ideas • -producible  -CCC canonical configuration • flattened→-CCC • -producible  flattenable • flattenable→ not locked • locked → abundant • not locked → rare • rare → search easier?

  33. Consequence (revisited) Theorem 2: The -producible configurations of chains are rare: The probability that a random configuration of a random chain is -producible approaches 0 as n∞.

  34. Configuration Space All configurations Flattenable configurations

  35. Why restriction to  ≤ 90º ?

  36. Protein Sidechains

  37. Tunnel Exit “Localization of proteins at the exit of the tunnel.”

  38. Open Problems: Locked Equilateral Chains? • Is there a configuration of a chain with universal joints, all of whose links have the same length, that is locked? • Is there a configuration of a 90o fixed-angle chain, all of whose links have the same length, that is locked? Perhaps: No? Perhaps: Yes for 1+e?

  39. Ribosome structure “The figure at bottom represents the interactions allowing pairing codon-anticodon. The elements of contact are marked (A) with (c). The anticodon of ARNt is in dark blue and the codon of ARNm in the site P is in red.” http://www.biochimie.univ-montp2.fr/maitrise/ribosome/sommaire.htm

More Related