Computing Protein Structures from Electron Density Maps: The Missing Fragment Problem Itay Lotan † Henry van den Bedem* Ashley M. Deacon* Jean-Claude Latombe.

Slides:



Advertisements
Similar presentations
Kinematic Synthesis of Robotic Manipulators from Task Descriptions June 2003 By: Tarek Sobh, Daniel Toundykov.
Advertisements

Antibody Structure Prediction and the Use of Mutagenesis in Docking Arvind Sivasubramanian, Aroop Sircar, Eric Kim & Jeff Gray Johns Hopkins University,
Rosetta Energy Function Glenn Butterfoss. Rosetta Energy Function Major Classes: 1. Low resolution: Reduced atom representation Simple energy function.
Forward and Inverse Kinematics CSE 3541 Matt Boggus.
A Combined Optimization Method for Solving the Inverse Kinematics Problem of Mechanical Manipulators Roland Mai B659, Spring 2010 Indiana University.
Iterative Relaxation of Constraints (IRC) Can’t solve originalCan solve relaxed PRMs sample randomly but… start goal C-obst difficult to sample points.
Geometric Algorithms for Conformational Analysis of Long Protein Loops J. Cortess, T. Simeon, M. Remaud- Simeon, V. Tran.
Optimization methods Morten Nielsen Department of Systems biology, DTU.
Computing Protein Structures from Electron Density Maps: The Missing Loop Problem I. Lotan, H. van den Bedem, A. Beacon and J.C. Latombe.
Prediction to Protein Structure Fall 2005 CSC 487/687 Computing for Bioinformatics.
With thanks to Zhijun Wu An introduction to the algorithmic problems of Distance Geometry.
CENTER FOR BIOLOGICAL SEQUENCE ANALYSISTECHNICAL UNIVERSITY OF DENMARK DTU Homology Modeling Anne Mølgaard, CBS, BioCentrum, DTU.
Two Examples of Docking Algorithms With thanks to Maria Teresa Gil Lucientes.
The TEXTAL System: Automated Model-Building Using Pattern Recognition Techniques Dr. Thomas R. Ioerger Department of Computer Science Texas A&M University.
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.
MAE 552 – Heuristic Optimization Lecture 6 February 6, 2002.
The TEXTAL System for Automated Model Building Thomas R. Ioerger Texas A&M University.
Computational Geometry, Algorithmic Robotics, and Molecular Modeling Dan Halperin School of Computer Science Tel Aviv University June 2007.
CSCE 641: Forward kinematics and inverse kinematics Jinxiang Chai.
Thomas Blicher Center for Biological Sequence Analysis
Protein Primer. Outline n Protein representations n Structure of Proteins Structure of Proteins –Primary: amino acid sequence –Secondary:  -helices &
Advanced Computer Graphics (Fall 2010) CS 283, Lecture 20: Inverse Kinematics Ravi Ramamoorthi Most slides courtesy.
Robotics Algorithms for the Study of Protein Structure and Motion Jean-Claude Latombe Computer Science Department Stanford University.
. Protein Structure Prediction [Based on Structural Bioinformatics, section VII]
Algorithm for Fast MC Simulation of Proteins Itay Lotan Fabian Schwarzer Dan Halperin Jean-Claude Latombe.
Robotics Algorithms for the Study of Protein Structure and Motion Based on Itay Lotan’s PhD Jean-Claude Latombe Computer Science Department Stanford University.
Physics of Protein Folding. Why is the protein folding problem important? Understanding the function Drug design Types of experiments: X-ray crystallography.
CENTER FOR BIOLOGICAL SEQUENCE ANALYSISTECHNICAL UNIVERSITY OF DENMARK DTU Homology Modelling Thomas Blicher Center for Biological Sequence Analysis.
The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Constraint-Based Motion Planning using Voronoi Diagrams Maxim Garber and Ming C. Lin Department of Computer.
A Kinematic View of Loop Closure EVANGELOS A. COUTSIAS, CHAOK SEOK, MATTHEW P. JACOBSON, KEN A. DILL Presented by Keren Lasker.
Protein Structure Prediction Samantha Chui Oct. 26, 2004.
Problem 1 Given a high-resolution computer image of a map of an irregularly shaped lake with several islands, determine the water surface area. Assume.
Inverse Kinematics for Molecular World Sadia Malik April 18, 2002 CS 395T U.T. Austin.
Computer Animation Rick Parent Computer Animation Algorithms and Techniques Kinematic Linkages.
Constraints-based Motion Planning for an Automatic, Flexible Laser Scanning Robotized Platform Th. Borangiu, A. Dogar, A. Dumitrache University Politehnica.
Practical session 2b Introduction to 3D Modelling and threading 9:30am-10:00am 3D modeling and threading 10:00am-10:30am Analysis of mutations in MYH6.
Inverse Kinematics.
Inverse Kinematics. Inverse Kinematics (IK) T q1q1 q2q2 q3q3 q4q4 q5q5 Given a kinematic chain (serial linkage), the position/orientation of one end relative.
Computing Missing Loops in Automatically Resolved X-Ray Structures Itay Lotan Henry van den Bedem (SSRL)
Approximation of Protein Structure for Fast Similarity Measures Fabian Schwarzer Itay Lotan Stanford University.
MolIDE2: Homology Modeling Of Protein Oligomers And Complexes Qiang Wang, Qifang Xu, Guoli Wang, and Roland L. Dunbrack, Jr. Fox Chase Cancer Center Philadelphia,
Conformational Space.  Conformation of a molecule: specification of the relative positions of all atoms in 3D-space,  Typical parameterizations:  List.
Multiple Mapping Method with Multiple Templates (M4T): optimizing sequence-to-structure alignments and combining unique information from multiple templates.
1 Inverse Kinematics and Protein Loop Closure Presenter: Chittaranjan Tripathy February 21, 2008 Figures are taken from the references unless otherwise.
Structure prediction: Homology modeling
Molecular Modelling - Lecture 2 Techniques for Conformational Sampling Uses CHARMM force field Written in C++
Protein Design with Backbone Optimization Brian Kuhlman University of North Carolina at Chapel Hill.
Algorithms Exploiting the Chain Structure of Proteins Itay Lotan Computer Science.
Modeling Protein Flexibility with Spatial and Energetic Constraints Yi-Chieh Wu 1, Amarda Shehu 2, Lydia Kavraki 2,3  Provided an approach to generating.
Conformational Space of a Flexible Protein Loop Jean-Claude Latombe Computer Science Department Stanford University (Joint work with Ankur Dhanik 1, Guanfeng.
An Introduction to Simulated Annealing Kevin Cannons November 24, 2005.
Forward and inverse kinematics in RNA backbone conformations By Xueyi Wang and Jack Snoeyink Department of Computer Science UNC-Chapel Hill.
CS-ROSETTA Yang Shen et al. Presented by Jonathan Jou.
Mean Field Theory and Mutually Orthogonal Latin Squares in Peptide Structure Prediction N. Gautham Department of Crystallography and Biophysics University.
Ab-initio protein structure prediction ? Chen Keasar BGU Any educational usage of these slides is welcomed. Please acknowledge.
Zhijun Wu Department of Mathematics Program on Bio-Informatics and Computational Biology Iowa State University Joint Work with Tauqir Bibi, Feng Cui, Qunfeng.
Numerical Methods for Inverse Kinematics Kris Hauser ECE 383 / ME 442.
Fundamentals of Computer Animation
Character Animation Forward and Inverse Kinematics
Computational Structure Prediction
Reduce the need for human intervention in protein model building
Maria Okuniewski Nuclear Engineering Dept.
Itay Lotan† Henry van den Bedem* Ashley M. Deacon*
Itay Lotan† Henry van den Bedem* Ashley M. Deacon*
Bowei Tang, Tianyu Chen, and Christopher Atkeson
Volume 20, Issue 3, Pages (March 2012)
Combining Efficient Conformational Sampling with a Deformable Elastic Network Model Facilitates Structure Refinement at Low Resolution  Gunnar F. Schröder,
Conformational Search
Humanoid Motion Planning for Dual-Arm Manipulation and Re-Grasping Tasks Nikolaus Vahrenkamp, Dmitry Berenson, Tamim Asfour, James Kuffner, Rudiger Dillmann.
Presentation transcript:

Computing Protein Structures from Electron Density Maps: The Missing Fragment Problem Itay Lotan † Henry van den Bedem* Ashley M. Deacon* Jean-Claude Latombe † † Computer Science Dept., Stanford University * Joint Center for Structural Genomics (JCSG) at SSRL

Structure determination Bernhard Rupp X-ray crystallography

Protein Structure Initiative 152K sequenced genes (30K/year) 25K determined structures (3.6K/year)  Reduce cost and time to determine protein structure  Develop software to automatically interpret the electron density map (EDM)

Electron Density Map (EDM) 3-D “image” of atomic structure High value (electron density) at atom centers Density falls off exponentially away from center Limited resolution, sampled on 3D grid

Automated model building  ~90% built at high resolution (2Å)  ~66% built at medium to low resolution (2.5 – 2.8Å)  Gaps left at noisy areas in EDM (blurred density) Gaps need to be resolved manually

The Fragment completion problem  Input Electron Density Map (EDM) Partially resolved structure 2 Anchor residues Length of missing fragment  Output A small number of candidate structures for missing fragment A robotics inverse kinematics (IK) problem

Related work Computer Science  Exact IK solvers Manocha & Canny ’94 Manocha et al. ’95  Optimization IK solvers Wang & Chen ’91  Redundant manipulators Khatib ’87 Burdick ’89  Motion planning for closed loops Han & Amato ’00 Yakey et al. ’01 Cortes et al. ’02, ’04 Biology/Crystallography  Exact IK solvers Wedemeyer & Scheraga ’99 Coutsias et al. ’04  Optimization IK solvers Fine et al. ’86 Canutescu & Dunbrack Jr. ’03  Ab-initio loop closure Fiser et al. ’00 Kolodny et al. ’03  Database search loop closure Jones & Thirup ’86 Van Vlijman & Karplus ’97  Semi-automatic tools Jones & Kjeldgaard ’97 Oldfield ’01

Contributions  Sampling of gap-closing fragments biased by the EDM  Refinement of fit to density without breaking closure  Fully automatic fragment completion software for X-ray Crystallography Novel application of a combination of inverse kinematics techniques

Torsion angle model Protein backbone is a kinematic chain

Two-stage IK method 1.Candidate generations: Optimize density fit while closing the gap 2.Refinement: Optimize closed fragments without breaking closure

Stage 1: candidate generation  Generate random conformation  Close using Cyclic Coordinate Descent (CCD) (Wang & Chen ’91, Canutescu & Dunbrack Jr. ’03)

Stage 1: candidate generation  Generate random conformation  Close using Cyclic Coordinate Descent (CCD) (Wang & Chen ’91, Canutescu & Dunbrack ’03)

Stage 1: candidate generation  Generate random conformation  Close using Cyclic Coordinate Descent (CCD) (Wang & Chen ’91, Canutescu & Dunbrack ’03)

Stage 1: candidate generation  Generate random conformation  Close using Cyclic Coordinate Descent (CCD) (Wang & Chen ’91, Canutescu & Dunbrack ’03)

Stage 1: candidate generation  Generate random conformation  Close using Cyclic Coordinate Descent (CCD) (Wang & Chen ’91, Canutescu & Dunbrack ’03) CCD moves biased toward high-density

Stage 2: refinement 1-D manifold  Target function T (goodness of fit to EDM)  Minimize T while retaining closure  Closed conformations lie on Self-motion manifold of lower dimension

Stage 2: null-space minimization Jacobian: linear relation between joint velocities and end-effector linear and angular velocity. Compute minimizing move using: N – orthonormal basis of null space

Stage 2: minimization with closure 1.Choose sub-fragment with n > 6 DOFs 2.Compute using SVD 3.Project onto 4.Move until minimum is reached or closure is broken Escape from local minima using Monte Carlo with simulated annealing

MC + Minimization (Li & Scheraga ’87)  Suggest large random change Random move in Exact IK solution for 3 residues (Coutsias et al. ’04)  Minimize resulting conformation  Accept using Metropolis criterion:  Use simulated annealing

Test: artificial gaps  Completed structure (gold standard)  Good density (1.6Å resolution)  Remove fragment and rebuild LengthHigh - 2.0ÅMedium - 2.5ÅLow - 2.8Å 4100% (0.14Å)100% (0.19Å)100% (0.32Å) 8100% (0.18Å)100% (0.23Å)100% (0.36Å) 1291% (0.51Å)96% (0.41Å)91% (0.52Å) 1591% (0.53Å)88% (0.63Å)83% (0.76Å) Produced by H. van den Bedem

Test: true gaps  Completed structure (gold standard)  OK density (2.4Å resolution)  6 gaps left by model builder (RESOLVE) LengthError 40.40Å 40.22Å 50.78Å 50.36Å 70.66Å Å Produced by H. van den Bedem

Example: TM0423 PDB: 1KQ3, 376 res. 2.0Å resolution 12 residue gap Best: 0.3Å aaRMSD

Example: TM0813 GLU-77 GLY-90 PDB: 1J5X, 342 res. 2.8Å resolution 12 residue gap Best: 0.6Å aaRMSD

Example: TM0813 GLU-77 GLY-90 PDB: 1J5X, 342 res. 2.8Å resolution 12 residue gap Best: 0.6Å aaRMSD

Example: TM0813 GLU-77 GLY-90 PDB: 1J5X, 342 res. 2.8Å resolution 12 residue gap Best 0.6Å aaRMSD

Alternative conformations A B TM0755, 1.8Å res. Produced by H. van den Bedem

Conclusion  Sampling of gap-closing fragments biased by the EDM  Refinement of fit to density without breaking closure  Fully automatic fragment completion software for X-ray Crystallography

Stage 1: Density-biased CCD  Compute pair that minimizes closure distance  Search square neighborhood for density maximum and move there.  The size of  is reduced with the number of iterations

Stage 2: Target function  EDM -  Computed (model) density -  Least-squares residuals between EDM and model density

Building a missing fragment 1.Generate 1000 fragments using CCD 2.Choose top 6 candidates 3.Refine each candidate 6 times 4.Save top 2 of each refinement set 12 final candidates are output

Testing: TM1621 2Å Res.2.8Å Res. PDB: 1O1Z, SCOP: α/β, 234 res. 34% helical, 19% strands Collected at 1.6Å res. 2mFo-DFc EDMs calculated at 2.0Å, 2.5Å, and 2.8Å 103 fragments of length 4,8,12 and 15 Produced by H. van den Bedem

Testing: TM1621 2Å Res.2.8Å Res. Produced by H. van den Bedem Helical fragments (>2/3 helical) account for most misses - mean - median - %>1Å aaRMSD

Testing: TM1742 PDB: 1VJR, 271 res. Collected at 2.4Å Good quality density 88% built using RESOLVE 5 gaps, 1 region built incorrectly Produced by H. van den Bedem

TM1621: running time LengthHigh (2.0)Medium (2.5Å)Low (2.8Å) Times reported in minutes