Finding Functionally Significant Structural Motifs in Proteins

Slides:



Advertisements
Similar presentations
Principal Component Analysis Based on L1-Norm Maximization Nojun Kwak IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008.
Advertisements

PCA + SVD.
Registration of two scanned range images using k-d tree accelerated ICP algorithm By Xiaodong Yan Dec
November 19, 2009Introduction to Cognitive Science Lecture 20: Artificial Neural Networks I 1 Artificial Neural Network (ANN) Paradigms Overview: The Backpropagation.
CSci 6971: Image Registration Lecture 4: First Examples January 23, 2004 Prof. Chuck Stewart, RPI Dr. Luis Ibanez, Kitware Prof. Chuck Stewart, RPI Dr.
Identifying Structural Motifs in Proteins Rohit Singh Joint work with Mitul Saha.
Agenda A brief introduction The MASS algorithm The pairwise case Extension to the multiple case Experimental results.
Lesson 8: Machine Learning (and the Legionella as a case study) Biological Sequences Analysis, MTA.
Detecting and Tracking Moving Objects for Video Surveillance Isaac Cohen and Gerard Medioni University of Southern California.
Basic Data Mining Techniques
Discovery of RNA Structural Elements Using Evolutionary Computation Authors: G. Fogel, V. Porto, D. Weekes, D. Fogel, R. Griffey, J. McNeil, E. Lesnik,
Sequence Alignment II CIS 667 Spring Optimal Alignments So we know how to compute the similarity between two sequences  How do we construct an.
Object Recognition. Geometric Task : find those rotations and translations of one of the point sets which produce “large” superimpositions of corresponding.
Chapter 4 (part 2): Non-Parametric Classification
Randomized Algorithms. Introduction Algorithm uses a random number to make at least one decision Running time depends on input and random numbers generated.
Recognition of object by finding correspondences between features of a model and an image. Alignment repeatedly hypothesize correspondences between minimal.
Camera parameters Extrinisic parameters define location and orientation of camera reference frame with respect to world frame Intrinsic parameters define.
Random Sample Consensus: A Paradigm for Model Fitting with Application to Image Analysis and Automated Cartography Martin A. Fischler, Robert C. Bolles.
כמה מהתעשייה? מבנה הקורס השתנה Computer vision.
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
CSE 185 Introduction to Computer Vision
Structural alignments of Proteins using by TOPOFIT method Vitkup D., Melamud E., Moult J., Sander C. Completeness in structural genomics. Nature Struct.
SVM by Sequential Minimal Optimization (SMO)
CSE554AlignmentSlide 1 CSE 554 Lecture 5: Alignment Fall 2011.
Multiple Alignment and Phylogenetic Trees Csc 487/687 Computing for Bioinformatics.
1 Pattern Recognition: Statistical and Neural Lonnie C. Ludeman Lecture 21 Oct 28, 2005 Nanjing University of Science & Technology.
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
Exploring Alternative Splicing Features using Support Vector Machines Feature for Alternative Splicing Alternative splicing is a mechanism for generating.
Artificial Intelligence Chapter 3 Neural Networks Artificial Intelligence Chapter 3 Neural Networks Biointelligence Lab School of Computer Sci. & Eng.
Pattern Classification All materials in these slides were taken from Pattern Classification (2nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John Wiley.
Clustering.
1  Problem: Consider a two class task with ω 1, ω 2   LINEAR CLASSIFIERS.
Introduction to Neural Networks Introduction to Neural Networks Applied to OCR and Speech Recognition An actual neuron A crude model of a neuron Computational.
Course14 Dynamic Vision. Biological vision can cope with changing world Moving and changing objects Change illumination Change View-point.
Prediction of Protein Binding Sites in Protein Structures Using Hidden Markov Support Vector Machine.
Lecture 11 CS5661 Structural Bioinformatics – Structure Comparison Motivation Concepts Structure Comparison.
EMBL-EBI Eugene Krissinel SSM - MSDfold. EMBL-EBI MSDfold (SSM)
Registration and Alignment Speaker: Liuyu
SUPPORT VECTOR MACHINES Presented by: Naman Fatehpuria Sumana Venkatesh.
Color Image Segmentation Mentor : Dr. Rajeev Srivastava Students: Achit Kumar Ojha Aseem Kumar Akshay Tyagi.
May 2003 SUT Color image segmentation – an innovative approach Amin Fazel May 2003 Sharif University of Technology Course Presentation base on a paper.
Data Mining – Algorithms: K Means Clustering
Pattern Recognition Lecture 20: Neural Networks 3 Dr. Richard Spillman Pacific Lutheran University.
2D Image registration with iterated local search Oscar Cordón 1 - Sergio Damas Arroyo 2 - Eric Bardinet 3 ( 1 ) Department of Computer Science and Artificial.
CSE 554 Lecture 8: Alignment
Combining Models Foundations of Algorithms and Machine Learning (CS60020), IIT KGP, 2017: Indrajit Bhattacharya.
Semi-Supervised Clustering
Supervised Learning in ANNs
Adaptive Resonance Theory (ART)
Constrained Clustering -Semi Supervised Clustering-
A Brief Introduction of RANSAC
Basic machine learning background with Python scikit-learn
CS 2750: Machine Learning Linear Regression
A special case of calibration
Unfolding Problem: A Machine Learning Approach
Outline S. C. Zhu, X. Liu, and Y. Wu, “Exploring Texture Ensembles by Efficient Markov Chain Monte Carlo”, IEEE Transactions On Pattern Analysis And Machine.
Artificial Intelligence Chapter 3 Neural Networks
Artificial Intelligence Chapter 3 Neural Networks
Boltzmann Machine (BM) (§6.4)
Artificial Intelligence Chapter 3 Neural Networks
Pattern Classification All materials in these slides were taken from Pattern Classification (2nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John.
Artificial Intelligence Chapter 3 Neural Networks
Pattern Classification All materials in these slides were taken from Pattern Classification (2nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John.
Shape-based Registration
K-Medoid May 5, 2019.
Unfolding with system identification
Calibration and homographies
Pattern Classification All materials in these slides were taken from Pattern Classification (2nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John.
Introduction to Machine learning
Artificial Intelligence Chapter 3 Neural Networks
Presentation transcript:

Finding Functionally Significant Structural Motifs in Proteins Jennifer Hicks

Introduction Goal of Protein Classification: Techniques Trypsin Evolutionary Relationships Functional Similarities Techniques Sequence Matching Whole Structure Matching Motif Matching Trypsin Active Site

Project Goal Find structural motif in an example protein INPUT: 3D, labeled coordinates Known Motif or Pattern Example Protein Output: Best Match Optimal Transform and Correspondence Set Partial Match RMSD

Algorithm Overview Generate small set of interest regions and correspondences from the example protein Align the input pattern to each interest region Choose the alignment with the lowest RMSD

Regions of Interest Input: Output: 3 pivot elements of pattern motif Error Threshold Output: Correspondence sets that satisfy constraints and labels

Alignment: Approach 1 Find an initial transform Create a full correspondence set using a closest neighbor method Find the optimal transform by aligning small random subsets of the current correspondence set Repeat steps 2 and 3 until RMSD stabilizes

Alignment: Approach 2 Find transform for current Correspondence Set with SVD Transform motif and update Correspondence Set to include sufficiently close elements Repeat steps 1 and 2 until Correspondence Set stops growing

Partial Match RMSD Approach 2: Penalty for items not included in final correspond. set Approach 1: Tukey function to allow for outliers T(x)

Running Time Let m = # Pattern Elements Let n = # Example Protein Elements Regions of Interest: Cubic in number of example protein elements that match pivot label Each iteration of Alignment: O(m) to compute transform O(mn) to update correspondences

Testing Generated 3D, labeled motif Randomly perturbed motif Aligned motif to generated proteins with and without the perturbed motif

Results

Future Work Regions of Interest: Protein Description: Partial Match: Grid Method Choose pivots based on biological significance Initial Alignment Protein Description: Labeling technique Orientation vectors Partial Match: Determine biological significance

References Singh, Rohit. Computational study of protein structure and folding: some interesting problems. Masters Thesis, Stanford University, 2002. Umcyama, Shinji. Least-Squares Estimation of Transformation Parameters Between Two Point Patterns. IEEE Transactions on Pattern Analysis and Machine Intelligence. 1991, 13(4). Protein Data Bank