Analyzing the Simplicial Decomposition of Spatial Protein Structures Rafael Ördög, Zoltán Szabadka, Vince Grolmusz.

Slides:



Advertisements
Similar presentations
Order-k Voronoi Diagram in the Plane
Advertisements

Guy EvenZvi LotkerDana Ron Tel Aviv University Conflict-free colorings of unit disks, squares, & hexagons.
DECISION TREES. Decision trees  One possible representation for hypotheses.
PARTITIONAL CLUSTERING
Surface Reconstruction From Unorganized Point Sets
 Distance Problems: › Post Office Problem › Nearest Neighbors and Closest Pair › Largest Empty and Smallest Enclosing Circle  Sub graphs of Delaunay.
3D Molecular Structures C371 Fall Morgan Algorithm (Leach & Gillet, p. 8)
Proximity graphs: reconstruction of curves and surfaces
KIM TAEHO PARK YOUNGMIN.  Curve Reconstruction problem.
Todd J.Taylor, Iosif I.Vaisman Abstract: A method of protein structural domain assignment using an Ising/Potts-like.
Computational Geometry II Brian Chen Rice University Computer Science.
CENG151 Introduction to Materials Science and Selection Tutorial 1 14 th September, 2007.
3D Shape Histograms for Similarity Search and Classification in Spatial Databases. Mihael Ankerst,Gabi Kastenmuller, Hans-Peter-Kriegel,Thomas Seidl Univ.
CHAPTER 5: CONVEX POLYTOPES Anastasiya Yeremenko 1.
3D spherical gridding based on equidistant, constant volume cells for FV/FD methods A new method using natural neighbor Voronoi cells distributed by spiral.
Computational Geometry -- Voronoi Diagram
17. Computational Geometry Chapter 7 Voronoi Diagrams.
2. Voronoi Diagram 2.1 Definiton Given a finite set S of points in the plane , each point X of  defines a subset S X of S consisting of the points of.
Computational Geometry and Spatial Data Mining
1 Lecture 8: Voronoi Diagram Computational Geometry Prof. Dr. Th. Ottmann Voronoi Diagrams Definition Characteristics Size and Storage Construction Use.
GSM MOBILE PHONE NETWORKS AND GRAPH COLORING
TU/e computational geometry introduction Mark de Berg.
UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2007 Chapter 5: Voronoi Diagrams Wednesday,
Mining frequent patterns in protein structures: A study of protease families Dr. Charles Yan CS6890 (Section 001) ST: Bioinformatics The Machine Learning.
Association Rules Presented by: Anilkumar Panicker Presented by: Anilkumar Panicker.
Voronoi diagrams of “nice” point sets Nina Amenta UC Davis “The World a Jigsaw”
High Throughput Processing of the Structural Information of the Protein Data Bank Zoltán Szabadka, Vince Grolmusz Department of Computer Science Eötvös.
Image Morphing, Triangulation CSE399b, Spring 07 Computer Vision.
Basics of protein structure and stability III: Anatomy of protein structure Biochem 565, Fall /29/08 Cordes.
A Statistical Geometry Approach to the Study of Protein Structure Majid Masso Bioinformatics and Computational Biology George Mason University.
More Graphs and Displays
UNC Chapel Hill M. C. Lin Point Location Chapter 6 of the Textbook –Review –Algorithm Analysis –Dealing with Degeneracies.
Module 2: Structure Based Ph4 Design
Being a binding site: Characterizing Residue-Composition of Binding Sites on Proteins joint work with Zoltán Szabadka and Gábor Iván, Protein Information.
Voronoi diagrams and applications Prof. Ramin Zabih
Transmembrane proteins in the Protein Data Bank: identification and classification Gabor, E. Tusnady, Zsuzanna Dosztanyi and Istvan Simon Bioinformatics,
5-Minute Check Name the polygon by the number of sides.
Algorithms for Triangulations of a 3D Point Set Géza Kós Computer and Automation Research Institute Hungarian Academy of Sciences Budapest, Kende u
PRE-TRIANGULATIONS Generalized Delaunay Triangulations and Flips Franz Aurenhammer Institute for Theoretical Computer Science Graz University of Technology,
EMBL-EBI Adel Golovin MSDsite The project is funded by the European Commission as the TEMBLOR, contract-no. QLRI-CT under the RTD programme.
Accelerating Ray Tracing using Constrained Tetrahedralizations Ares Lagae & Philip Dutré 19 th Eurographics Symposium on Rendering EGSR 2008Wednesday,
Question 1: Name, PDB codes Eric Martz (no research lab) Macromolecular visualization I chose*: 3onz HUMAN TETRAMERIC HEMOGLOBIN:
On Graphs Supporting Greedy Forwarding for Directional Wireless Networks W. Si, B. Scholz, G. Mao, R. Boreli, et al. University of Western Sydney National.
A. Polyhedrons 1. Vocabulary of Polyhedrons 2. Building Polyhedrons a. Create a net from the Polyhedron b. Create the Polyhedron from the net B. Prisms.
Order-k Voronoi diagram in the plane Dominique Schmitt Université de Haute-Alsace.
Voronoi Diagram (Supplemental)
L8 - Delaunay triangulation L8 – Delaunay triangulation NGEN06(TEK230) – Algorithms in Geographical Information Systems.
Universität Stuttgart Institute of Parallel and Distributed Systems (IPVS) Universitätsstraße 38 D Stuttgart Voronoi Overlay Networks Pavel Skvortsov.
UNC Chapel Hill M. C. Lin Delaunay Triangulations Reading: Chapter 9 of the Textbook Driving Applications –Height Interpolation –Constrained Triangulation.
9.6 Circles in the Coordinate Plane Date: ____________.
Data Mining By Farzana Forhad CS 157B. Agenda Decision Tree and ID3 Rough Set Theory Clustering.
Equations of Circles. You can write an equation of a circle in a coordinate plane, if you know: Its radius The coordinates of its center.
June 23, Variational tetrahedral meshing of mechanical models for FEA Matthijs Sypkens Smit Willem F. Bronsvoort CAD ’08 Conference, Orlando, Florida.
1 Three-Body Delaunay Statistical Potentials of Protein Folding Andrew Leaver-Fay University of North Carolina at Chapel Hill Bala Krishnamoorthy, Alex.
Delaunay Triangulations and Control-Volume Meshing Michael Murphy.
Chemistry
Chemistry
Progression of Geometry
3.1 Clustering Finding a good clustering of the points is a fundamental issue in computing a representative simplicial complex. Mapper does not place any.
Localizing the Delaunay Triangulation and its Parallel Implementation
Chemistry
12.1 Exploring Solids.
Valence Shell Electron Pair Repulsion Theory
Bonding Theories 8.3 This car is being painted by a process called electrostatic spray painting. The negatively charged droplets are attracted to the auto.
Unusual ligand structure in Ni–Fe active center and an additional Mg site in hydrogenase revealed by high resolution X-ray structure analysis  Yoshiki.
8.3 Molecular Orbitals When two atoms combine, the molecular orbital model assumes that their atomic orbitals overlap to produce molecular orbitals,
Chemistry
Valence Shell Electron Pair Repulsion Theory
Data Mining Classification: Alternative Techniques
Presentation transcript:

Analyzing the Simplicial Decomposition of Spatial Protein Structures Rafael Ördög, Zoltán Szabadka, Vince Grolmusz

Aims of our research Aims  Easy to use protein database containing relevant geometrical data on proteins. (Capable of treating thousands of PDB entries at once.)  Drug discovery by data mining in the database.

Steps of our research Steps  Cleaning and restructuring the PDB (RS-PDB) Done by Zoltan Szabadka  Creating a database of geometrical & chemo- geometrical data Under construction in our present research  Discovering rules, and creating learning systems for ligand pre-docking. Mostly later work

Delaunay Decompositions To find the Delaunay decomposition of a set, we have used the qhull algorithm, its source is available at:

Important properties of Delaunay decompositions Regions are defined by circum spheres being empty (Region is empty as well) Regions are tetrahedra except if more than 4 points are on the same sphere.

Important properties of Delaunay decompositions Partition of the convex hull of A. The graph defined by the edges of the Delaunay regions: Delaunay Graph  Can be used for searching closest neighbors

Delaunay decomposition of heavy atoms of the protein in 1n9c with the ligand

Important properties of Delaunay decompositions The “dual” structure can solve the Post Office problem.  Partitioning the city into service areas of given post offices, so that every one belongs to the closest post office.  Duality here is only theoretical, in practice it is the same structure. (Voronoi diagram.)

Previous work Singh, Tropsha and Vaisman The point set was chosen to be the set of C α atoms of the protein Aim: predict secondary protein structure In contrast: we chose the point set to be the set of all heavy atoms. (Non hydrogen atoms.)

Volume

Tetrahedrality

Volume and tetrahedrality Tetrahedrality: 0 for regular tetrahedra, and < 1  i<j (l i -l j ) 2 ) (15 (  i l i / 6) 2 )

Frequency Two dimensional temperature plots of the frequency of regions with given volume and tetrahedrality.  In all proteins (Our whole database)  In a given protein

Volume and tetrahedrality of all regions (C α atoms)

Volume and tetrahedrality of all regions (Heavy atoms)

Volume and tetrahedrality of all regions

Volume and tetrahedrality of regions with ligand atom

Volume and tetrahedrality of all regions (Heavy atoms)

Classifying by corner atoms Question: are the different peaks in the earlier plots in connection with the function of the corner atoms?  Classification by the symbols of corner atoms  Classification by hetid of the residues the atom is found in. Question: How frequent are different corner atom sets?

Most frequent corner sets

Connection of volume and tetrahedrality corner atom set

Volume and tetrahedrality of all regions (Heavy atoms)

Frequency of metals in different types of tetrahedra CCNOCNOOCNNOCOOOCCNNNNOONOOOCNNNNNNOOOOOCCCSNNNNCCNSCCSSNOSS ZN MG FE MN CA Ca appears almost exclusively in the vicinity of four Oxygen Zn prefers NOSS and NNNO type of tetrahedra, but also frequent in CNOO NNOO NOOO Only Zn was found in NOSS

Thank you

About the geometric extension Presently we cannot handle:  Missing atoms  Precision errors, non-tetrahedral regions The PDB is handled as a juggled input The resulting database can only be used for quality statistical purposes. Strongly restricted database.  No missing atoms, 2.2 Ǻ resolution, includes protein 5757 such PDB (June 23, 2006 ) Our current research addresses the problems above.

Recent problems For example aromatic rings should be on one circle, in one plane, hence on one sphere, but they refuse to be:  Distortion is minor, not recognizable by eye Is it just measuring error? Or is it due to the structure around the ring?  In contrast some atoms not expected to fall on one sphere tend to do so.

Structure of the geometric extension Essential:  Corner Reference to the atoms in the RS-PDB  Region the radius and coordinates of the center of the circum sphere volume and tetrahedrality of the tetrahedron three type of bond graphs code hetid, atom name, and symbol set assigned to the regions corner set and more Additional: Edge, Neighbor, (Ligand) Atom