1 / 42

Conformational Space of a Flexible Protein Loop

Conformational Space of a Flexible Protein Loop. Jean-Claude Latombe Computer Science Department Stanford University (Joint work with Ankur Dhanik 1 , Guanfeng Liu 2 , Itay Lotan 3 , Henry van den Bedem 4 , Jim Milgram 5 , Nathan Marz 6 , and Charles Kou 6 ). 1 Graduate student 2 Postdoc

lucas
Télécharger la présentation

Conformational Space of a Flexible Protein Loop

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. Conformational Space of a Flexible Protein Loop Jean-Claude Latombe Computer Science DepartmentStanford University (Joint work with Ankur Dhanik1, Guanfeng Liu2, Itay Lotan3, Henry van den Bedem4, Jim Milgram5, Nathan Marz6, and Charles Kou6) 1 Graduate student 2 Postdoc 3 Now a postdoc at U.C. Berkeley4 Joint Center for Structural Genomics, Stanford Linear Accelerator Center 5 Department of Mathematics, Stanford University 6 Undergraduate CS students

  2. Initial Project “Noise” in electron density maps from X-ray crystallography  4-20 aa fragments unresolved by existing software (RESOLVE, TEXTAL, ARP, MAID)  Model completion is high-throughput bottleneck

  3. Fragment Completion Problem • Input: • Electron-density map • Partial structure • Two “anchor” residues • Amino-acid sequence of missing fragment • Output: • Conformations of fragment that • Respect the closure constraint (IK) • Maximize match with electron-density map

  4. Two-Stage Method[H. van den Bedem, I. Lotan, J.C. Latombe and A. M. Deacon. Real-space protein-model completion: An inverse-kinematics approach. Acta Crystallographica, D61:2-13, 2005.] • Candidate generations Closed fragments • Candidate refinement Optimize fit with EDM

  5. Stage 1: Candidate Generation Loop: • Generate random conformation of fragment (only one end is at its “anchor”) • Close fragment – i.e., bring other end to second anchor – using Cyclic Coordinate Descent (CCD)[A.A. Canutescu and R.L. Dunbrack Jr. Cyclic coordinate descent: A robotics algorithm for protein loop closure. Prot. Sci. 12:963–972, 2003]

  6. dq3 dq2 (q1,q2,q3) dq1 Stage 2: Candidate Refinement • Target function T(Q)measuring quality of the fit with the EDM • Minimize T while retaining closure Null space

  7. Refinement Procedure Repeat until minimum is reached: • Compute a basis N of the null space at current Q (using SVD of Jacobian matrix) • Compute gradient T of target function at current Q [Abe et al., Comput. Chem., 1984] • Move by small increment along projection of T into null space (i.e., along dQ = NNT T) + Monte Carlo + simulated annealing protocol to deal with local minima

  8. Tests #1: Artificial Gaps • Complete structures (gold standard) resolved with EDM at 1.6Å resolution • Compute EDM at 2, 2.5, and 2.8Å resolution • Remove fragments and rebuild Short Fragments: 100% < 1.0Å aaRMSD Long Fragments: 12: 96% < 1.0Å aaRMSD 15: 88% < 1.0Å aaRMSD

  9. Tests #2: True Gaps • Structure computed by RESOLVE • Gaps completed independently (gold standard) • Example: TM1742 (271 residues) • 2.4Å resolution; 5 gaps left by RESOLVE Produced by H. van den Bedem

  10. TM1621 • Green: manually completed conformation • Blue: conformation computed by stage 1 • Pink: conformation computed by stage 2 • The aaRMSD improved by 2.4Å to 0.31Å

  11. A A323 Hist A316 Ser B Two-State Loop • TM0755: data at 1.8Å • 8-residue fragment crystallized in 2 conformations •  the EDM is difficult to interpret • Generate 2 conformations Q1 and Q2 using CCD • TH-EDM(Q1,Q2,a) = theoretical EDM created by distribution aQ1 + (1-a)Q2 • Maximize fit of TH-EDM(Q1,Q2,a) with experimental EDM by moving in null space N(Q1)N(Q2)[0,1]

  12. Status • Software running with Xsolve, JCSG’s structure-solution software suite • Used by crystallographers at JCSG for structure determination • Contributed to determining several structures recently deposited in PDB

  13. Lesson • “Fuzziness” in EDM due to loop motion is not “noise” • Instead, it may be exploited to extract information on loop mobility

  14. New 4-year NSF project (DMS-0443939,Bio-Math program) • Goal:Create a representation (probabilistic roadmap) of the conformation space of a protein loop, with a probabilistic distribution over this representation • Applications: • Motion from X-ray crystallography • Improvement of homology methods • Predicting loop motion for drug design • Conformation tweaking (MC optimization, decoy generation)

  15. Predicting Loop Motion [J. Cortés, T. Siméon, M. Renaud-Siméon, and V. Tran. J. Comp. Chemistry, 25:956-967, 2004]

  16. Ongoing Work • Develop software tools to create and manipulate loop conformations • Study the topological structure of a loop conformational space

  17. Software tools implemented • CCD • Exact IK for 3 residues (non-necessarily contiguous)  Creation of loop conformations

  18. Exact IK for 3 Residues[E.A. Coutsias, C. Seok, M.J. Jacobson, K.A. Dill. A Kinematic View of Loop Closure, J. Comp. Chemistry, 25(4):510 – 528, 2004] Maximal number of solutions: 10, 12?

  19. Closing loops using CCD + Exact IK

  20. Closing loops using CCD + Exact IK

  21. Software tools implemented • CCD • Exact IK for 3 residues (non-necessarily contiguous)  Creation of loop conformations • Computation of pseudo-inverse of Jacobian and null-space basis  Loop deformation in null space  Conformation sampling

  22. Moving an atom along a line

  23. Interpolating between two conformations

  24. Sampling many conformations

  25. Software tools implemented • CCD • Exact IK for 3 residues (non-necessarily contiguous)  Creation of loop conformations • Computation of pseudo-inverse of Jacobian and null-space basis  Loop deformation in null space  Conformation sampling • Detection of steric clashes (grid method)

  26. Topological Structure of Conformational Space • Inspired by work of Trinkle and Milgram on closed-loop kinematic chains • Leads to studying singularities of open protein chains and of their images

  27. Configuration Space of a 4R Closed-Loop Chain l3 Rigid link l4 l2 l1 Revolute joint [J.C. Trinkle and R.J. Milgram, Complete Path Planning for Closed Kinematic Chains with Spherical Joints, Int. J. of Robotics Research, 21(9):773-789, 2002]

  28. Configuration Space of a 4R Closed-Loop Chain l3 l4 l2 l1 [J.C. Trinkle and R.J. Milgram, Complete Path Planning for Closed Kinematic Chains with Spherical Joints, Int. J. of Robotics Research, 21(9):773-789, 2002]

  29. Images of the singularities of the red linkage’s endpoint map: C 2 Configuration Space of a 4R Closed-Loop Chain [J.C. Trinkle and R.J. Milgram, Complete Path Planning for Closed Kinematic Chains with Spherical Joints, Int. J. of Robotics Research, 21(9):773-789, 2002]

  30. Configuration Space of a 4R Closed-Loop Chain l1 [J.C. Trinkle and R.J. Milgram, Complete Path Planning for Closed Kinematic Chains with Spherical Joints, Int. J. of Robotics Research, 21(9):773-789, 2002]

  31. Configuration Space of a 4R Closed-Loop Chain l1 [J.C. Trinkle and R.J. Milgram, Complete Path Planning for Closed Kinematic Chains with Spherical Joints, Int. J. of Robotics Research, 21(9):773-789, 2002]

  32. Images of the singularities of the red linkage’s endpoint map: C 2 S1|S1 IS1 S1|S1 I(S1S1) Configuration Space of a 5R Closed-Loop Chain [J.C. Trinkle and R.J. Milgram, Complete Path Planning for Closed Kinematic Chains with Spherical Joints, Int. J. of Robotics Research, 21(9):773-789, 2002]

  33. C N Ca N How does it apply to a protein loop?

  34. C N Ca N How does it apply to a protein loop?

  35. C N Ca N How does it apply to a protein loop?

  36. C N Ca N Images of the singularities of the red linkage map: C  3SO(3) 2D surfacein3SO(3)

  37. N Ca C Kinematic Model ~60dg

  38. Singularities of Map C  R3 • Rank 1 singularities: Planar linkage • Rank 2 singularities: • Type 1 • Type 2

  39. Planar sub-linkages Line contained in P0 P0 Singularities of Map C  R3 • Rank 1 singularities: Planar linkage • Rank 2 singularities: • Type 1 • Type 2

  40. Endpoint iscontained in all planes P0, P1, and P2 L There is a line L contained in P2 to which P0 and P1 are // Must be // to each other and // to last plane Singularities of Map C  R3 • Rank 1 singularities: Planar linkage • Rank 2 singularities: • Type 1 • Type 2 P2 P1 P0

  41. Images of Singularities rank 1 singularity Singularities are on the periphery of the endpoint’s reachable space

  42. Impact on Flexible Loops?

More Related