Algorithm for Fast MC Simulation of Proteins Itay Lotan Fabian Schwarzer Dan Halperin Jean-Claude Latombe.

Slides:

Advertisements

Similar presentations

Christian Lauterbach COMP 770, 2/16/2009. Overview  Acceleration structures  Spatial hierarchies  Object hierarchies  Interactive Ray Tracing techniques.

Advertisements

Complete Motion Planning

Rosetta Energy Function Glenn Butterfoss. Rosetta Energy Function Major Classes: 1. Low resolution: Reduced atom representation Simple energy function.

Presented by Konstantinos Georgiadis. Abstract This method extends the Hierarchical Radiosity approach for environments whose geometry and surface attributes.

2.1. C OLLISION D ETECTION Overview. Collision detection is used within many types of application, e.g. from robotics, through engineering simulations,

Geometric Representations & Collision Detection Kris Hauser I400/B659: Intelligent Robotics Spring 2014.

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.

Algorithmic Robotics and Motion Planning Dan Halperin Tel Aviv University Fall 2006/7 Dynamic Maintenance and Self-Collision Testing for Large Kinematic.

Computing Protein Structures from Electron Density Maps: The Missing Loop Problem I. Lotan, H. van den Bedem, A. Beacon and J.C. Latombe.

Bio-CS Exploration of Molecular Conformational Spaces Jean-Claude Latombe Computer Science Department Robotics Laboratory & Bio-X Clark Center.

Two Examples of Docking Algorithms With thanks to Maria Teresa Gil Lucientes.

1 1 Static & Dynamic Maintenance of Kinematic Structures Spheres, Molecules, and Hidden Surface Removal D. Halperin and M-H. Overmars Dynamic Maintenance.

1 Single Robot Motion Planning - II Liang-Jun Zhang COMP Sep 24, 2008.

Self-Collision Detection and Prevention for Humonoid Robots Paper by James Kuffner et al. Presented by David Camarillo.

“Inverse Kinematics” The Loop Closure Problem in Biology Barak Raveh Dan Halperin Course in Structural Bioinformatics Spring 2006.

Self-Collision Detection and Prevention for Humonoid Robots Paper by James Kuffner et al. Jinwhan Kim.

Computational Geometry, Algorithmic Robotics, and Molecular Modeling Dan Halperin School of Computer Science Tel Aviv University June 2007.

Robotics Algorithms for the Study of Protein Structure and Motion Jean-Claude Latombe Computer Science Department Stanford University.

Dynamic Maintenance and Self Collision Testing for Large Kinematic Chains Lotan, Schwarzer, Halperin, Latombe.

Self-Collision Detection and Prevention for Humanoid Robots James Kuffner et al. presented by Jinsung Kwon.

Adaptive Dynamic Collision Checking for Single and Multiple Articulated Robots in Complex Environments Schwarzer, Saha, and Latombe CS326A Winter 2004,

CS 326 A: Motion Planning robotics.stanford.edu/~latombe/cs326/2004/index.htm Collision Detection and Distance Computation.

Efficient Nearest-Neighbor Search in Large Sets of Protein Conformations Fabian Schwarzer Itay Lotan.

Robotics Algorithms for the Study of Protein Structure and Motion Based on Itay Lotan’s PhD Jean-Claude Latombe Computer Science Department Stanford University.

Stochastic roadmap simulation for the study of ligand-protein interactions Mehmet Serkan Apaydin, Carlos E. Guestrin, Chris Varma, Douglas L. Brutlag and.

4. Modeling 3D-periodic systems Cut-off radii, charges groups Ewald summation Growth units, bonds, attachment energy Predicting crystal structures.

Structure and Motion Jean-Claude Latombe Computer Science Department Stanford University NSF-ITR Meeting on November 14, 2002.

Stochastic Roadmap Simulation: An Efficient Representation and Algorithm for Analyzing Molecular Motion Mehmet Serkan Apaydin, Douglas L. Brutlag, Carlos.

Protein Side Chain Packing Problem: A Maximum Edge-Weight Clique Algorithmic Approach Dukka Bahadur K.C, Tatsuya Akutsu and Tomokazu Seki Proceedings of.

Efficient Distance Computation between Non-Convex Objects By Sean Quinlan Presented by Sean Augenstein and Nicolas Lee.

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

Hybrid Bounding Volumes for Distance Queries Distance Query returns the minimum distance between two geometric models Major application is path planning.

Algorithmic Robotics and Molecular Modeling Dan Halperin School of Computer Science Tel Aviv University June 2007.

CS 326A: Motion Planning ai.stanford.edu/~latombe/cs326/2007/index.htm Collision Detection and Distance Computation.

The Geometry of Biomolecular Solvation 1. Hydrophobicity Patrice Koehl Computer Science and Genome Center

Efficient Maintenance and Self-Collision Testing for Kinematic Chains Itay Lotan Fabian Schwarzer Dan Halperin Jean-Claude Latombe.

Inverse Kinematics for Molecular World Sadia Malik April 18, 2002 CS 395T U.T. Austin.

Bioinf. Data Analysis & Tools Molecular Simulations & Sampling Techniques117 Jan 2006 Bioinformatics Data Analysis & Tools Molecular simulations & sampling.

Molecular Modeling Part I Molecular Mechanics and Conformational Analysis ORG I Lab William Kelly.

Empirical energy function Summarizing some points about typical MM force field In principle, for a given new molecule, all force field parameters need.

World space = physical space, contains robots and obstacles Configuration = set of independent parameters that characterizes the position of every point.

Efficient Maintenance and Self- Collision Testing for Kinematic Chains Itay Lotan Fabian Schwarzer Dan Halperin Jean-Claude Latombe.

Rotamer Packing Problem: The algorithms Hugo Willy 26 May 2010.

Protein Design CS273: Final Project Charles Kou Crystal structure of top7 – A novel protein structure created with RosettaDesign.

Computing Missing Loops in Automatically Resolved X-Ray Structures Itay Lotan Henry van den Bedem (SSRL)

Evolving Virtual Creatures & Evolving 3D Morphology and Behavior by Competition Papers by Karl Sims Presented by Sarah Waziruddin.

Mathematical Models of Folded and Unfolded Protein Ensembles Gregory Chirikjian Department of Mechanical Engineering Johns Hopkins University.

Approximation of Protein Structure for Fast Similarity Measures Fabian Schwarzer Itay Lotan Stanford University.

Conformational Space.  Conformation of a molecule: specification of the relative positions of all atoms in 3D-space,  Typical parameterizations:  List.

A Technical Introduction to the MD-OPEP Simulation Tools

Protein Folding and Modeling Carol K. Hall Chemical and Biomolecular Engineering North Carolina State University.

Molecular simulation methods Ab-initio methods (Few approximations but slow) DFT CPMD Electron and nuclei treated explicitly. Classical atomistic methods.

New Strategies for Protein Folding Joseph F. Danzer, Derek A. Debe, Matt J. Carlson, William A. Goddard III Materials and Process Simulation Center California.

1 Energy Maintenance for Molecular Simulation kinematics + energy  motion + structure Main computational issue: Proximity computation.

Molecular Modelling - Lecture 2 Techniques for Conformational Sampling Uses CHARMM force field Written in C++

Path Integral Quantum Monte Carlo Consider a harmonic oscillator potential a classical particle moves back and forth periodically in such a potential x(t)=

Flexible Spanners: A Proximity and Collision Detection Tool for Molecules and Other Deformable Objects Jie Gao, Leonidas Guibas, An Nguyen Computer Science.

Chapter 11 Collision Detection 가상현실 입문 그래픽스 연구실 민성환.

Indexing Correlated Probabilistic Databases Bhargav Kanagal, Amol Deshpande University of Maryland, College Park, USA SIGMOD Presented.

Modeling Protein Flexibility with Spatial and Energetic Constraints Yi-Chieh Wu 1, Amarda Shehu 2, Lydia Kavraki 2,3  Provided an approach to generating.

Dynamic Maintenance of Molecular Surfaces under Conformational Changes Eran Eyal and Dan Halperin Tel-Aviv University.

Molecular dynamics (MD) simulations  A deterministic method based on the solution of Newton’s equation of motion F i = m i a i for the ith particle; the.

Protein Structure Prediction: Threading and Rosetta BMI/CS 576 Colin Dewey Fall 2008.

K -Nearest-Neighbors Problem. cRMSD  cRMSD(c,c ’ ) is the minimized RMSD between the two sets of atom centers: min T [(1/n)  i=1, …,n ||a i (c) – T(a.

Minkowski Sums and Distance Computation Eric Larsen COMP

2.1. Collision Detection Overview.

Efficient Energy Computation for Monte Carlo Simulation of Proteins

N19 - VSEPR and the 3D Geometry of Molecules

Presentation transcript:

Algorithm for Fast MC Simulation of Proteins Itay Lotan Fabian Schwarzer Dan Halperin Jean-Claude Latombe

MC Simulation Classic technique for studying thermodynamic properties of proteins Random walk through conformation space: –Propose random change in conformation –Accept new conformation with probability that depends on difference in energy (Metropolis criterion):

Our Contribution A generic algorithm for MCS which has: –Efficient incremental update of conformation given m simultaneous changes –Efficient computation of energy terms –Reuse of unchanged energy terms The algorithm supports most molecule representations, energy functions and simulation methodologies

Requirements 1.Small number of DOF changes per step 2.Energy function with: A.Bonded terms (bond length, bond angle, etc.) B.Pairwise non-bonded terms (vdW, elctrostatic, etc.) with cutoff distances

Useful Properties of MCS A protein is a long kinematic chain Small number of changes  large rigid sub-chains Cutoff distance  small subset of all pairs is needed Many energy terms can be reused

Challenges How to update the conformation without re-computing the position of all atoms? How to efficiently find all pairs of atoms whose distance is below the cutoff (interacting pairs)? How to efficiently discover which energy terms have changed and which can be reused?

Related Work The algorithm is based on a self-collision detection method for kinematic chains we presented at SoCG02 Biologists have used many tricks and heuristics to speed up their simulations. There is no general method exploiting common properties of all MCS exists

Molecule Representation Twofold hierarchical structure: Transformations hierarchy to approximate the kinematics of the protein at different resolutions Bounding Volume hierarchy to approximate the geometry of the protein at different resolutions

Transformations Hierarchy Hierarchy of “shortcut” transformations Sequence of reference frames (links) connected by rigid-body transformations (joints)

BV Hierarchy Chain-aligned: bottom-up, along the chain Each BV encloses its two children in the hierarchy

Computing distances - RSS RSS (rectangle swept sphere) - The Minkowski sum of a rectangle and a sphere (Larsen et al., ICRA 2000)

One Binary Tree

Updating and Searching

Complexity Updating: Finding all interacting pairs: Performs much better in practice!!! Worst-case

Interaction Tree Hierarchy of possible interactions between sub-chains of the protein Based on our hierarchical representation of the protein Stores partial sums of non-bonded pairwise energy terms Allows efficient reuse of unchanged terms

Interaction Tree

Results: 1-DOF change (68)(144)(374) (755)

Results: 5-DOF change (68)(144)(374)(755)

First-Pass Steric Clash Detection (68)(144)(374) (755)

What next? Implement a real force field: EEF1 (Lazaridis & Karplus) Based on CHARMM19 9Å cutoff distance Implicit solvent as sum of pairwise terms Run MCS of proteins with 60 – 80 residues. Run simulation of a set of small proteins – misfolding.

Open Problem How to find good moves to make when the conformation becomes compact and random moves are rejected with high probability?