Derivatives of Backbone Motion Kimberly Noonan, Jack Snoeyink UNC Chapel Hill Computer Science.

Slides:



Advertisements
Similar presentations
Polygon overlay in double precision arithmetic One example of why robust geometric code is hard to write Jack Snoeyink & Andrea Mantler Computer Science,
Advertisements

Links and Joints.
Rosetta Energy Function Glenn Butterfoss. Rosetta Energy Function Major Classes: 1. Low resolution: Reduced atom representation Simple energy function.
Computational Experiments with a Lone-Pair Based Hydrogen-Bonding Energy Function in Mini-Rosetta YOUR NAME HERE (Arial 28 pt italic)YOUR PROJECT URL HERE.
Inverse Kinematics Course site:
Manipulator’s Inverse kinematics
Direct & Inverse Kinematics
Separating Electronic and Nuclear Motions The Born-Oppenheimer Approximation All Computational Chemistry rests on a fundamental assumption called.
Protein Threading Zhanggroup Overview Background protein structure protein folding and designability Protein threading Current limitations.
Geometric Algorithms for Conformational Analysis of Long Protein Loops J. Cortess, T. Simeon, M. Remaud- Simeon, V. Tran.
Computing Protein Structures from Electron Density Maps: The Missing Loop Problem I. Lotan, H. van den Bedem, A. Beacon and J.C. Latombe.
Two Examples of Docking Algorithms With thanks to Maria Teresa Gil Lucientes.
Time to Derive Kinematics Model of the Robotic Arm
Taking a Numeric Path Idan Szpektor. The Input A partial description of a molecule: The atoms The bonds The bonds lengths and angles Spatial constraints.
“Inverse Kinematics” The Loop Closure Problem in Biology Barak Raveh Dan Halperin Course in Structural Bioinformatics Spring 2006.
IK: Choose these angles!
Protein Primer. Outline n Protein representations n Structure of Proteins Structure of Proteins –Primary: amino acid sequence –Secondary:  -helices &
FLEX* - REVIEW.
Ch. 3: Forward and Inverse Kinematics
Inverse Kinematics How do I put my hand here? IK: Choose these angles!
Molecular Docking Using GOLD Tommi Suvitaival Seppo Virtanen S Basics for Biosystems of the Cell Fall 2006.
Levels of protein structure organization
Mechanical Engineering Dept, SJSU
A Kinematic View of Loop Closure EVANGELOS A. COUTSIAS, CHAOK SEOK, MATTHEW P. JACOBSON, KEN A. DILL Presented by Keren Lasker.
Inverse Kinematics Jacobian Matrix Trajectory Planning
Exact Analytical Formulation for coordinated motions in Polypeptide Chains Vageli Coutsias*, Chaok Seok** and Ken Dill** with applications to: Fast Exact.
An Introduction to Robot Kinematics
The Geometry of Biomolecular Solvation 1. Hydrophobicity Patrice Koehl Computer Science and Genome Center
Kinematics Fundamentals
MEE 3025 MECHANISMS WEEK 2 BASIC CONCEPTS. Mechanisms A group of rigid bodies connected to each other by rigid kinematic pairs (joints) to transmit force.
Inverse Kinematics for Molecular World Sadia Malik April 18, 2002 CS 395T U.T. Austin.
Goal Directed Design of Serial Robotic Manipulators
Advanced Graphics (and Animation) Spring 2002
Definition of an Industrial Robot
What are proteins? Proteins are important; e.g. for catalyzing and regulating biochemical reactions, transporting molecules, … Linear polymer chain composed.
02/03/10 CSCE 769 Dihedral Angles Homayoun Valafar Department of Computer Science and Engineering, USC.
 Four levels of protein structure  Linear  Sub-Structure  3D Structure  Complex Structure.
RNA Secondary Structure Prediction Spring Objectives  Can we predict the structure of an RNA?  Can we predict the structure of a protein?
Mechanism Design Graphical Method
Rotamer Packing Problem: The algorithms Hugo Willy 26 May 2010.
Computing Missing Loops in Automatically Resolved X-Ray Structures Itay Lotan Henry van den Bedem (SSRL)
Conformational Entropy Entropy is an essential component in ΔG and must be considered in order to model many chemical processes, including protein folding,
Altman et al. JACS 2008, Presented By Swati Jain.
Protein Design with Backbone Optimization Brian Kuhlman University of North Carolina at Chapel Hill.
Outline: Introduction Solvability Manipulator subspace when n<6
Modeling Protein Flexibility with Spatial and Energetic Constraints Yi-Chieh Wu 1, Amarda Shehu 2, Lydia Kavraki 2,3  Provided an approach to generating.
Placing hydrogens by dynamic programming By Xueyi Wang Department of Computer Science UNC-Chapel Hill.
Lecture 6 - Single Variable Problems & Systems of Equations CVEN 302 June 14, 2002.
FlexWeb Nassim Sohaee. FlexWeb 2 Proteins The ability of proteins to change their conformation is important to their function as biological machines.
Forward and inverse kinematics in RNA backbone conformations By Xueyi Wang and Jack Snoeyink Department of Computer Science UNC-Chapel Hill.
Automated Refinement (distinct from manual building) Two TERMS: E total = E data ( w data ) + E stereochemistry E data describes the difference between.
Structure Visualization
Find the optimal alignment ? +. Optimal Alignment Find the highest number of atoms aligned with the lowest RMSD (Root Mean Squared Deviation) Find a balance.
Kinematics of machines ( )
NUS CS 5247 David Hsu Protein Motion. NUS CS 5247 David Hsu2 What is a protein?  Primary level - a sequence of alphabets (amino acid molecules)  Amino.
IK: Choose these angles!
IK: Choose these angles!
Computational design of protein function
Zaid H. Rashid Supervisor Dr. Hassan M. Alwan
Protein Structure Prediction and Protein Homology modeling
Reduce the need for human intervention in protein model building
CHAPTER 2 FORWARD KINEMATIC 1.
Volume 9, Issue 2, Pages (February 2002)
Volume 14, Issue 2, Pages (February 2006)
Volume 23, Issue 12, Pages (December 2015)
Volume 86, Issue 4, Pages (April 2004)
Analysis of crystal structures
Outline: Introduction Solvability Manipulator subspace when n<6
Chi H. Mak, Tyler Matossian, Wen-Yeuan Chung  Biophysical Journal 
LC8 is structurally variable but conserved in sequence.
Presentation transcript:

Derivatives of Backbone Motion Kimberly Noonan, Jack Snoeyink UNC Chapel Hill Computer Science

Outline Protein design Related work Local backbone motion Derivative algorithm Ongoing work

Protein design Operations –Visualize structure Mage, Chime –Modify structure Dezymer Example [Hellinga] –RBP (Ribose Binding Protein) bind zinc bind TNT

Dezymer software H. Hellinga, L. Looger … Input: fixed backbone and ligand Output: top-ranked receptor designs Method: –Identifies molten zone –Freezes side chains outside zone –Frees side chains inside zone by mutation to Alanine. –Ranks all possible mutation configurations and ligand orientations using energy functions

Binding site design RBP binding TNT [Hellinga] Dezymer decorated wild type backbone

Binding site design improved? RBP binding TNT [Hellinga] Dezymer decorated wild type backbone vs. Dezymer’s redesign of rubbed backbone

Crystallographic refinement crystallographic structure Structure obtained with out hydrogens Some bad clashes result after hydrogens are added Red spikes = bad clashes Blue dots = favorable interactions

Crystallographic refinement crystallographic structure best choice of rotamer?

Crystallographic refinement crystallographic structure best choice of rotamer? rubbed backbone with same rotamer

Protein modification Operations –Side chain mutation –Rotamer selection –Backbone movement CAD for local backbone motion? –Modify segment of backbone, leave remainder of chain fixed

Geometry for proteins Loop Closure Problem –Given n-atom chain linked by fixed bond lengths and angles –Given positions of first and last two atoms –Determine all possible positions of the n-4 intervening atoms a2a2 anan a1a1 a n-1 aiai

zizi yiyi xixi atom i-1 atom i atom i+1 b i-1 bibi b i+1 θiθi ωiωi Local frame, F i = {X i, Y i, Z i }, at atom i Let R i = R Xi (ω i )* R Zi (θ i )*T Zi (d i ), where d i = |b i | Then, F i = R i * F i-1 Denavit-Hartenberg local frames

Loop closure: three residues –9 atoms –Assume peptide bonds are planar –Fix position and orientation of N 1 and C 3 –Assume ideal bond geometry C β1 C β2 C β3 N1N1 C3C3

Loop closure: three residues –9 atoms –Assume peptide bonds are planar –Fix position and orientation of N 1 and C 3 –Assume ideal bond geometry –Free dihedral angles (φ, ψ) –6 degrees of freedom

Related work: Computational tool –Manocha, Canny, 95 –Eigenvalue problem –Returns set of feasible solutions Exact analytical solution –Wedemeyer, Sheraga, 99 –spherical geometry –16 degree polynomial empirically at most 8 feasible solutions

Local backbone motion 6 degrees of freedom –yields discrete solutions Need 7 th DoF for continuous movement –variable bond angle Derivative –direction and magnitude of movement –with respect to the variable angle

7 th variable angle N-C α -C bond angle (Tau) Derivative with respect to Tau angle Closed form solution (adapt exact analytic) Estimate derivative with algorithm

Derivative algorithm Input: –Chain length and geometry –Desired bond angle to be varied Output: –Derivative estimate Method: –Fixes local frames of outermost atoms –Frees all intermediate φ, ψ angles –Matlab optimization technique to solve for resulting atom positions

One swinging C β C β1 C β2 C β3 φ1φ1 φ2φ2 φ3φ3 ψ1ψ1 ψ2ψ2 ψ3ψ3 N1N1 C3C3 Three residue segment –fix outermost atoms N 1 and C 3 –6 free dihedrals –modify center tau Tau

One swinging C β

Two swinging C β ‘s Four residue segment –fix outermost C α ‘s –6 free dihedrals –modify one intermediate tau ψ3ψ3 ψ2ψ2 ψ1ψ1 C β2 C β1 C β3 C β4 φ1φ1 φ2φ2 φ3φ3 C α1 C α4 Tau

Two swinging C β ‘s

Ongoing work Extend analytic solution –to handle variable geometry Determine closed form solution for derivative Extend to several geometric modifications

The End