1 / 64

Geometrical RING Optimization

Geometrical RING Optimization. Evangelos Coutsias Dept of Mathematics and Statistics, Univ. of New Mexico. Jointly with Chaok Seok, Matthew Jacobson, and Ken Dill Dept of Pharmaceutical Chemistry, UCSF Michael Wester Office of Biocomputing, UNM. Abstract.

georgina
Télécharger la présentation

Geometrical RING Optimization

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. Geometrical RING Optimization Evangelos CoutsiasDept of Mathematics and Statistics, Univ. of New Mexico

  2. Jointly withChaok Seok, Matthew Jacobson, and Ken DillDept of Pharmaceutical Chemistry, UCSF Michael WesterOffice of Biocomputing, UNM

  3. Abstract In previous work, we considered the problem of loop closure, i.e., of finding the ensemble of possible backbone structures of a chain molecule that are consistent geometrically with preceding and following parts of the chain whose structures are given. We provided a simple intuitive view and derivation of a 16th degree polynomial equation for the case in which the six torsion angles used for the closure belong in three coterminal pairs. Our work generalized previous results on analytical loop closure as our torsion angles need not be consecutive, and any rigid intervening segments are allowed between the free torsions. We combined the new scheme with an existing loop construction algorithm to sample protein loops longer than three residues and used it to implement a set of local moves for Monte Carlo minimization. Here we present an application to the sampling of S2-bridged 9-peptide loops and discuss the implementation of the local moves as a Metropolis Monte Carlo scheme for the uniform sampling of conformational space.

  4. Tripeptide LoopClosure With the base and the lengths of the two peptide virtual bonds fixed, the vertex is constrained to lie on a circle. Bond vectors fixed in space Fixed distance

  5. The triangle formed by three consecutive Ca atoms: Given the span, d, there are constraints on the orientation of the middle Cb, the side chain and the two coterminal peptide units about the virtual bonds between the Ca (green circles). Designing a 9-peptide ring

  6. Given the span, the two consecutive peptide units are correlated

  7. This extends to the orientation of Cb

  8. A bimodal example

  9. Theta-perturbations are not enough

  10. 1r69: Res 9-19 alternative backbone configurations

  11. Representation of Loop Structures In the original frame In the new frame

  12. New View of Loop Closure Old View 6 rotations / 6 constraints New View 3 rotations / 3 constraints

  13. Crank Follower Two-revolute, two-spheric-pair mechanism

  14. The 4-bar spherical linkage

  15. y Transfer Function for concerted rotations d x z

  16. z y R1 R2 1 2 x 4 3 L2 L1 A complete cycle through the allowed values for j (dihedral (R1,R2) -(L1,R1) )and y (dihedral (R1,R2)-(L2,R2))

  17. t a =.35*p r1=.81=r2

  18. Derivation of a 16th Degree Polynomial for the 6-angle Loop Closure 2 ri-1 ·ri = cos i gives Pi(ui-1, ui) =  pjk ui-1j uik , where ui=tan(i/2). Using the method of resultants, the three biquadratic equations P1(u3, u1), P2(u1, u2), and P3(u2, u3) are reduced to a polynomial in u3, R16(u3) =  rju3j j,k=0 r2 r1 16 j=0

  19. Method of resultants gives an equivalent 16th degree polynomial for a single variable Numerical evidence that at most 8 real solutions exist. Must be related to parameter values: the similar problem of the 6R linkage in a multijointed robot arm is known to possess 16 solutions for certain ranges of parameter values (Wampler and Morgan ’87; Lee and Liang ‘’89).

  20. The Minkowski sum of three squares, of side a, b, c resp. Here a=2x, b=2y, c=2z are the sizes of three scaled Newton polytopes for the three biquadratics

  21. There are at most 16 solutions: from first principles By the Bernstein-Kushnirenko-Khovanski theorem the total number of isolated solutions cannot exceed the mixed volume of the Minkowski sum of the Newton Polytopes of the consitutive polynomial components. That is, the number 16 is generic for this problem.

  22. Methods of determining all zeros: (1) carry out resultant elimination; derive univariate polynomial of degree 16 solve using Sturm chains and deflation (2) carry out resultant elimination but convert matrix polynomial to a generalized eigenproblem of size 24 (3) work directly with trigonometric version; use geometry to define feasible intervals and exhaustively search. It is important to allow flexibility in some degrees of freedom

  23. Loop Closure Algorithm • Polynomial coefficients are determined in terms of the geometric parameters on the right. • u3 =tan(3/2) is obtained by solving the polynomial equation. 3, 1, and 2 follow. • Positions of the all atoms are determined by transforming to the original frame. 1 2 3

  24. General Chain Loop Closure

  25. 7-Angle Loop Closure

  26. The continuous move used in Monte Carlo energy minimization

  27. The continuous move: given a state assume D2b, D4a fixed, but D3 variable tau2sigma4 determined by D3 (1) tau1sigma2, tau4sigma5 trivial (2) alpha1, alpha5 variable but depend only on vertices as do lengths (lengths 1-2, 1-5, 4-5 are fixed) Given these sigma1tau1, sigma5tau5 known (sigma1tau5 given) (3) Dihedral (2-1-5-4) fixes remainder: alpha2, alpha4 determined (sigma2tau2, sigma4tau4 known)

  28. Longer Loop Closure in Combination with an Existing Loop Construction Method Analytical closure of the two arms of a loop in the middle

  29. Coutsias, Seok, Jacobson and Dill, J Comp Chem 25(4), 510 (2004) Jacobson, et al, Proteins, 2004. Canutescu and Dunbrack, Protein Science, 12, 963 (2003).

  30. Refinement of 8 residue loop (84-91) of turkey egg white lysozyme Native structure (red) and initial structure (blue) Baysal, C. and Meirovitch, H., J. Phys. Chem. A, 1997, 101, 2185

  31. B A pep virtual bond 3-pep bridge C design triangle 9-pep ring cysteine bridge 1 2 Modeling R. Larson’s 9-peptide 3 Designing a 9-peptide ring

  32. In designing a 9-peptide ring, the known parameters of 2-pep bridges (and those of the S2 bridge, if present) are incorporated in the choice of the foundation triangle, with vertices A,B,C (3 DOF) C B A

  33. C B A peptide virtual bond (3 dof for placement)x3=9 2-pep virtual bond (at most 8 solutions) design triangle sides (3 dof )

  34. 4-6-2 8-2-4 4-2-4 4-2-2 Cyclic 9-peptide backbone design Numbers denote alternative loop closure solutions at each side of the brace triangle

  35. Disulfide Loop Closure • Start at of the “last” Cysteine residue • The dihedral angle is a free variable: vary continuously to get all possible conformations. • Fix the bonds: and • Note that a move rooted at the “first” Cysteine must not fix but rather

  36. Disulfide Bridge Loop Closure

  37. PEP25: CLLRMKSAC

More Related