Dali: A Protein Structural Comparison Algorithm Using 2D Distance Matrices.

Slides:



Advertisements
Similar presentations
Introduction to Bioinformatics
Advertisements

Structural bioinformatics
Two Examples of Docking Algorithms With thanks to Maria Teresa Gil Lucientes.
Optimatization of a New Score Function for the Detection of Remote Homologs Kann et al.
Developing Pairwise Sequence Alignment Algorithms Dr. Nancy Warter-Perez.
FAST: A Novel Protein Structure Alignment Algorithm Jianhua Zhu and Zhiping Weng PROTEINS: Structure, Function, and Bioinformatics 58:618–627 (2005) Created.
Developing Pairwise Sequence Alignment Algorithms Dr. Nancy Warter-Perez June 23, 2005.
1 1. BLAST (Basic Local Alignment Search Tool) Heuristic Only parts of protein are frequently subject to mutations. For example, active sites (that one.
Identifying functional residues of proteins from sequence info Using MSA (multiple sequence alignment) - search for remote homologs using HMMs or profiles.
Developing Pairwise Sequence Alignment Algorithms Dr. Nancy Warter-Perez June 23, 2004.
Appendix: Automated Methods for Structure Comparison Basic problem: how are any two given structures to be automatically compared in a meaningful way?
Protein structure prediction May 30, 2002 Quiz#4 on June 4 Learning objectives-Understand difference between primary secondary and tertiary structure.
Similar Sequence Similar Function Charles Yan Spring 2006.
Developing Pairwise Sequence Alignment Algorithms Dr. Nancy Warter-Perez May 20, 2003.
Sequence Alignment III CIS 667 February 10, 2004.
Identification of Domains using Structural Data Niranjan Nagarajan Department of Computer Science Cornell University.
Sequence analysis of nucleic acids and proteins: part 1 Based on Chapter 3 of Post-genome Bioinformatics by Minoru Kanehisa, Oxford University Press, 2000.
1-month Practical Course Genome Analysis Lecture 3: Residue exchange matrices Centre for Integrative Bioinformatics VU (IBIVU) Vrije Universiteit Amsterdam.
Scoring matrices Identity PAM BLOSUM.
Bioinformatics Unit 1: Data Bases and Alignments Lecture 3: “Homology” Searches and Sequence Alignments (cont.) The Mechanics of Alignments.
Sequence Alignments Revisited
Multiple Sequence Alignments
Developing Pairwise Sequence Alignment Algorithms Dr. Nancy Warter-Perez May 10, 2005.
Alignment methods II April 24, 2007 Learning objectives- 1) Understand how Global alignment program works using the longest common subsequence method.
Information theoretic interpretation of PAM matrices Sorin Istrail and Derek Aguiar.
TM Biological Sequence Comparison / Database Homology Searching Aoife McLysaght Summer Intern, Compaq Computer Corporation Ballybrit Business Park, Galway,
Multiple Sequence Alignment CSC391/691 Bioinformatics Spring 2004 Fetrow/Burg/Miller (Slides by J. Burg)
Developing Pairwise Sequence Alignment Algorithms
Pairwise & Multiple sequence alignments
Phylogeny Estimation: Traditional and Bayesian Approaches Molecular Evolution, 2003
Multiple Sequence Alignment May 12, 2009 Announcements Quiz #2 return (average 30) Hand in homework #7 Learning objectives-Understand ClustalW Homework#8-Due.
Chapter 9 Superposition and Dynamic Programming 1 Chapter 9 Superposition and dynamic programming Most methods for comparing structures use some sorts.
Protein Sequence Alignment and Database Searching.
CRB Journal Club February 13, 2006 Jenny Gu. Selected for a Reason Residues selected by evolution for a reason, but conservation is not distinguished.
Chapter 11 Assessing Pairwise Sequence Similarity: BLAST and FASTA (Lecture follows chapter pretty closely) This lecture is designed to introduce you to.
Classifier Evaluation Vasileios Hatzivassiloglou University of Texas at Dallas.
Sequence analysis: Macromolecular motif recognition Sylvia Nagl.
Multiple Alignment and Phylogenetic Trees Csc 487/687 Computing for Bioinformatics.
Pairwise Sequence Alignment. The most important class of bioinformatics tools – pairwise alignment of DNA and protein seqs. alignment 1alignment 2 Seq.
Sequence Analysis CSC 487/687 Introduction to computing for Bioinformatics.
Particle Filters for Shape Correspondence Presenter: Jingting Zeng.
Protein Folding Programs By Asım OKUR CSE 549 November 14, 2002.
Comp. Genomics Recitation 3 The statistics of database searching.
Inferring Functional Information from Domain co-evolution Yohan Kim, Mehmet Koyuturk, Umut Topkara, Ananth Grama and Shankar Subramaniam Gaurav Chadha.
Construction of Substitution Matrices
Multiple alignment: Feng- Doolittle algorithm. Why multiple alignments? Alignment of more than two sequences Usually gives better information about conserved.
Sequence Alignment Csc 487/687 Computing for bioinformatics.
Protein Classification II CISC889: Bioinformatics Gang Situ 04/11/2002 Parts of this lecture borrowed from lecture given by Dr. Altman.
Multiple Alignment and Phylogenetic Trees Csc 487/687 Computing for Bioinformatics.
©CMBI 2005 Transfer of information The main topic of this course is transfer of information. A month in the lab can easily save you an hour in front of.
PROTEIN STRUCTURE SIMILARITY CALCULATION AND VISUALIZATION CMPS 561-FALL 2014 SUMI SINGH SXS5729.
Protein Structure Prediction: Homology Modeling & Threading/Fold Recognition D. Mohanty NII, New Delhi.
Alignment methods April 21, 2009 Quiz 1-April 23 (JAM lectures through today) Writing assignment topic due Tues, April 23 Hand in homework #3 Why has HbS.
Pair-wise Structural Comparison using DALILite Software of DALI Rajalekshmy Usha.
Course14 Dynamic Vision. Biological vision can cope with changing world Moving and changing objects Change illumination Change View-point.
MINRMS: an efficient algorithm for determining protein structure similarity using root-mean-squared-distance Andrew I. Jewett, Conrad C. Huang and Thomas.
Pairwise sequence alignment Lecture 02. Overview  Sequence comparison lies at the heart of bioinformatics analysis.  It is the first step towards structural.
Step 3: Tools Database Searching
Comparative methods Basic logics: The 3D structure of the protein is deduced from: 1.Similarities between the protein and other proteins 2.Statistical.
Lecture 11 CS5661 Structural Bioinformatics – Structure Comparison Motivation Concepts Structure Comparison.
Topics in bioinformatics CS697 Spring 2011 Class 12 – Mar Molecular distance measurements Molecular transformations.
An Efficient Index-based Protein Structure Database Searching Method 陳冠宇.
Techniques for Protein Sequence Alignment and Database Searching G P S Raghava Scientist & Head Bioinformatics Centre, Institute of Microbial Technology,
DNA SEQUENCE ALIGNMENT FOR PROTEIN SIMILARITY ANALYSIS CARL EBERLE, DANIEL MARTINEZ, MENGDI TAO.
Find the optimal alignment ? +. Optimal Alignment Find the highest number of atoms aligned with the lowest RMSD (Root Mean Squared Deviation) Find a balance.
Substitution Matrices and Alignment Statistics BMI/CS 776 Mark Craven February 2002.
Structural Bioinformatics Elodie Laine Master BIM-BMC Semester 3, Genomics of Microorganisms, UMR 7238, CNRS-UPMC e-documents:
There are four levels of structure in proteins
Intro to Alignment Algorithms: Global and Local
Protein structure prediction.
Presentation transcript:

Dali: A Protein Structural Comparison Algorithm Using 2D Distance Matrices

Main Points for Discussion Overview of why structural comparison can be a useful mode of analysis. Using a 2-D distance matrix to represent a 3-D protein structure. Specific computer algorithms that have been used to accomplish this analysis, including Monte Carlo optimization. Further applications of Dali.

Why consider structural comparison? 1D sequence comparisons has traditionally been (and still is) used to determine degree of relatedness, although a low degree of sequence homology may yield surprisingly similar structures. 3D structural alignment is aimed at providing more information about the structure-function similarities between proteins with non- detectable evolutionary relationships.

The Distance Matrix and How It’s Read 2 1 3

Assignment of Equivalent Residue Pairs

Additive Similarity Score (general) i and j are labeled pairs of equivalent (matched) residues (i.e. i = i A,i B ).   = similarity measure based on Ca-Ca distances dAij and dBij Largest S corresponds to optimal set of equivalencies. S =   (i,j) i = 1j = 1 LL

Rigid Similarity Score  R (i,j) =  R – | d A ij – d B ij | d A ij and d B ij are equivalenced residues in proteins A and B.   R = zero level of similarity

Elastic Similarity Score d * ij = the average of d A ij and d B ij   E = tolerance of 20% deviation w(r) = envelope function = exp(-r 2 /  2 )   (i,j) = | d A ij – d B ij |  E d * ij w(d * ij )  E -

Robustness of Dali

Quality of Generated Alignments Accuracy was verified by examining conserved functional residues in seeemingly divergent structures. The elasticity score is useful in that it captures relative movements of structural elements (e.g. ATP binding site in hsp70) and leaves only extremely non-homologous loops unaligned.

Quality of Generated Alignments (cont.) Detection of inter-domain motion brings functionally important residues into focus (e.g. ATP binding site in hsp70). Manipulation of the elastic similarity score determines the stringency of the alignment.

Examination of Relatedness Using a Dendrogram Dendrogram

Further Applications of Dali Continuing further in an attempt to map the entire protein space using quantitative comparisons between structures (correspondence analysis on p. 133) Applications to residue-residue energy interactions to create a more accurate biochemical representation of the protein. Also able to yield more useful information to predict 3D structure from amino acid sequence due to the energies of interacting residues.