5. Simple case – two closely related proteins with the same number of amino acids. Structure alignment Problem A B Introduction Method Results Outlook T Find a transformation to achieve the best superposition
6. Structure Alignment Problem Two sets of Points in 3D space: A = (a1, a2, …, an) B = (b1, b2, …, bm) A(P) , B(Q): Optimal subsets with | A(P) |=| B(Q) |, Introduction Method Results Outlook Optimal rigid body transformation (calculated by Diamond (1998) method) Distance { d( A(P) - T( B(Q) ) ) } min T
7.
8.
9.
10.
11.
12. Algorithm Intra-Molecular distance Seed Alignments (Fragments & Quartets) Next Best Frag Quartet 1 Quartet 2 .............. .............. Alignment Dynamic Programming i<N No Stop C α Match? increased Yes No Sup. Archive Yes Optimization Best Supp. Display Best Alignment Introduction Method Results Outlook Structures Superimpose
20. C α Match increased Yes Intra-Mol distance based Seed Alignments (Fragments & Quartets) Next No Best Frag Quartet 1 Quartet 2 .............. .............. Alignment Dynamic Programming Optimization C α Matches ? Increase Yes No Improved? i<N Sup. Archive Yes No i<M Yes Yes No Optimization Stop Get Supp. Display Best Alignment Next No Superimpose Structures Superimpose
21. Similarity Score : similarity score used in DP :distance :distance resulting in half-maximal similarity M :maximum score for a match Source: Gerstein Levitt, 1998 Introduction Method Results Outlook
22. Quality Function Q score, ratio of no. of aligned residues & RMSD :number of matches (equivalent residues) :length of structure 1 & 2 respectively :empirical parameter measuring Relative significance of & RMSD Source: Krissinel & Henrich (2004) Introduction Method Results Outlook
Good Afternoon everybody! I am Nasir Mahmood Currently I am a Postgraduate Diploma Student Cologne University Bioinformatics Center (CUBIC), Cologne. Today, Here I am going to talk about Protein Structure Alignment.