Nice plotting of proteins II

Similar documents
( ) [ ( k) ( k) ( x) ( ) ( ) ( ) [ ] ξ [ ] [ ] [ ] ( )( ) i ( ) ( )( ) 2! ( ) = ( ) 3 Interpolation. Polynomial Approximation.

Modeling curves. Graphs: y = ax+b, y = sin(x) Implicit ax + by + c = 0, x 2 +y 2 =r 2 Parametric:

Polynomial Regression Models

Convexity preserving interpolation by splines of arbitrary degree

Chapter Newton s Method

The equation of motion of a dynamical system is given by a set of differential equations. That is (1)

Module 2. Random Processes. Version 2 ECE IIT, Kharagpur

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X

NUMERICAL DIFFERENTIATION

Chapter 4: Root Finding

Bezier curves. Michael S. Floater. August 25, These notes provide an introduction to Bezier curves. i=0

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE

Chapter 13: Multiple Regression

Least squares cubic splines without B-splines S.K. Lucas

MA 323 Geometric Modelling Course Notes: Day 13 Bezier Curves & Bernstein Polynomials

Numerical Heat and Mass Transfer

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity

Section 8.3 Polar Form of Complex Numbers

Linear Feature Engineering 11

Report on Image warping

Chapter 3 Differentiation and Integration

Lecture 10 Support Vector Machines II

Review of Taylor Series. Read Section 1.2

Linear Approximation with Regularization and Moving Least Squares

Difference Equations

Modelli Clamfim Equazioni differenziali 22 settembre 2016

Bézier curves. Michael S. Floater. September 10, These notes provide an introduction to Bézier curves. i=0

Formal solvers of the RT equation

APPENDIX A Some Linear Algebra

ALGORITHM FOR THE CALCULATION OF THE TWO VARIABLES CUBIC SPLINE FUNCTION

ME 501A Seminar in Engineering Analysis Page 1

For now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.

Modelli Clamfim Equazioni differenziali 7 ottobre 2013

Lecture 2: Numerical Methods for Differentiations and Integrations

BAYESIAN CURVE FITTING USING PIECEWISE POLYNOMIALS. Dariusz Biskup

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0

CALCULUS CLASSROOM CAPSULES

The Quadratic Trigonometric Bézier Curve with Single Shape Parameter

PHYS 705: Classical Mechanics. Calculus of Variations II

ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM

Note 10. Modeling and Simulation of Dynamic Systems

10. Canonical Transformations Michael Fowler

The Fourier Transform

Kernel Methods and SVMs Extension

Department of Quantitative Methods & Information Systems. Time Series and Their Components QMIS 320. Chapter 6

Problem Points Score Total 100

2 Finite difference basics

EEE 241: Linear Systems

= z 20 z n. (k 20) + 4 z k = 4

TR/95 February Splines G. H. BEHFOROOZ* & N. PAPAMICHAEL

Comparison of Regression Lines

Canonical transformations

Newton s Method for One - Dimensional Optimization - Theory

Georgia Tech PHYS 6124 Mathematical Methods of Physics I

MMA and GCMMA two methods for nonlinear optimization

1 Generating functions, continued

Monotonic Interpolating Curves by Using Rational. Cubic Ball Interpolation

Lecture 13 APPROXIMATION OF SECOMD ORDER DERIVATIVES

SIMPLE REACTION TIME AS A FUNCTION OF TIME UNCERTAINTY 1

Assortment Optimization under MNL

1 Matrix representations of canonical matrices

Additional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty

Problem Set 9 Solutions

2.29 Numerical Fluid Mechanics

Lecture 5 Decoding Binary BCH Codes

COS 521: Advanced Algorithms Game Theory and Linear Programming

APPENDIX 2 FITTING A STRAIGHT LINE TO OBSERVATIONS

is the calculated value of the dependent variable at point i. The best parameters have values that minimize the squares of the errors

Chapter 11: Simple Linear Regression and Correlation

University of California, Davis Date: June 22, 2009 Department of Agricultural and Resource Economics. PRELIMINARY EXAMINATION FOR THE Ph.D.

Homework Assignment 3 Due in class, Thursday October 15

COMPLEX NUMBERS AND QUADRATIC EQUATIONS

Application of B-Spline to Numerical Solution of a System of Singularly Perturbed Problems

8.592J: Solutions for Assignment 7 Spring 2005

Limited Dependent Variables

Mathematical Preparations

Cubic Trigonometric Rational Wat Bezier Curves

Suppose that there s a measured wndow of data fff k () ; :::; ff k g of a sze w, measured dscretely wth varable dscretzaton step. It s convenent to pl

CIVL 8/7117 Chapter 10 - Isoparametric Formulation 42/56

Some modelling aspects for the Matlab implementation of MMA

12. The Hamilton-Jacobi Equation Michael Fowler

Notes on Frequency Estimation in Data Streams

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

Marginal Effects in Probit Models: Interpretation and Testing. 1. Interpreting Probit Coefficients

Isogeometric Analysis with Geometrically Continuous Functions on Multi-Patch Geometries. Mario Kapl, Florian Buchegger, Michel Bercovier, Bert Jüttler

Linear Correlation. Many research issues are pursued with nonexperimental studies that seek to establish relationships among 2 or more variables

Affine and Riemannian Connections

Analytical Chemistry Calibration Curve Handout

Analysis of Discrete Time Queues (Section 4.6)

Affine transformations and convexity

Structure and Drive Paul A. Jensen Copyright July 20, 2003

Lecture 17 : Stochastic Processes II

Optimal Representation of Piecewise Hölder Smooth Bivariate Functions by the Easy Path Wavelet Transform

AERODYNAMICS I LECTURE 6 AERODYNAMICS OF A WING FUNDAMENTALS OF THE LIFTING-LINE THEORY

Visualization of Data Subject to Positive Constraints

Linear Regression Analysis: Terminology and Notation

TR/28. OCTOBER CUBIC SPLINE INTERPOLATION OF HARMONIC FUNCTIONS BY N. PAPAMICHAEL and J.R. WHITEMAN.

Lecture 21: Numerical methods for pricing American type derivatives

Statistics for Business and Economics

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Transcription:

Nce plottng of protens II Fnal remark regardng effcency: It s possble to wrte the Newton representaton n a way that can be computed effcently, usng smlar bracketng that we made for the frst representaton of the polynomal ( ( )) ( ) = + ( ) + ( ) + ( ) polynomal x c x x c x x c x x 3 3... Is polynomal nterpolaton good for plottng proten curves? After the lengthy ntroducton to polynomals and nterpolaton t s about the tme to ask: Is the polynomal ft any good for proten chans? Can we use polynomal fts to get a much smoother and better vews of proten structures? Polynomal fts are sound f hgher order dervatves of the true functon (beyond the order of the polynomal) do not contrbute sgnfcantly to the descrpton of the functon. However, the reverse s also true If hgh order dervatves do make a sgnfcant contrbuton then the ft s not sound. Consder for example a typcal secondary structure element n proten - the beta pleated sheet. To a frst approxmaton a beta pleated sheet s a smple straght lne where the C α atoms are equally space on t. Snce the proten shape s compact the chan must come back on tself. At the end of a secondary structure element, there s usually a sharp turn modfyng consderably the drecton of the chan. Let us try to create a smple model of the above qualtatve descrpton and check what s the result of a polynomal ft that we may obtan. Our chan wll be embedded (for smplcty) n two dmensons. The chan s of length 0, the frst nne ponts are along the X-axs and the last two ponts represent a sharp turn backward. Here s a quck vew of the above n MATLAB >> x x = >> y y = 3 4 5 6 7 8 9 9 8 0 0 0 0 0 0 0 0 0 >> plot(x,y)

Now let us try to get a polynomal ft to the above proten model. Here s a MATLAB code that does t: >> t = :; >> cx = polyft(t,x,length(t)-); >> cy = polyft(t,y,length(t)-); >> t=:0.:; >> polyx = polyval(cx,t); >> polyy = polyval(cy,t); >> plot(polyx,polyy)

Well, t s qute clear that the over-shootng of the turn s not what we had n mnd about a smooth and more pleasng representaton of the proten chan. We need to fnd an alternatve way of generatng the smooth representaton of the proten path. The problem we have s that we ft a large number of ponts (amno acd postons) to a sngle polynomal. If the curve vares sgnfcantly and abruptly as the ndex of the amno acd (the t varable), then volent responses, whch do not concde wth our vew of proten shapes, may occur. The polynomal s smooth and dfferentable to all orders. However, for graphcal presentatons, ths may be unnecessary. We can hardly detect (by lookng at a curve) that a thrd dervatve of the curve s dscontnuous. We usually are able to detect a dscontnuous second dervatve. We therefore set a somewhat mlder threshold a ft that s locally contnuous up to a second dervatve. Ths leads to the noton of pecewse contnuous functon and to cubc splne nterpolaton. The problem can be formulated as follows: Gven a set of ponts (, ),(, ),...,(, ) t x t x tn x n we wsh to ft a pecewse contnuous curve to t. Ths means that we wll ft sequental subsets of ponts to cubc functons and

nsst that the functon, frst and second dervatves wll match at the boundary. The Hermte nterpolaton scheme s smple and therefore a good startng pont: Consder the edges of the nterval that we wsh to ft ( x L and x R - two ponts only of the complete data ponts). We wrte the polynomal q( x ) nterpolatng between the two ponts as: ( ) ( ) ( ) ( ) q( x) = a+ b x xl + c x xl + d xxl x xr The parameters a d are determned from the condtons that the functon and the frst dervatve wll be contnuous at the edges of the nterval (when we patch addtonal polynomals n between). There are four condtons that are suffcent to determne the four parameters (functon and frst dervatve of the functon at the two end ponts). The set of lnear equatons that we need to solve s a = yl b= y' L a+ b x+ c x = yr b+ c x+ d x = y' ( x = x x ) R L R The above procedure makes the frst dervatves contnuous at the matchng ponts. The second dervatves are not consdered. We therefore mmedately upgrade the level of our nterpolaton to cubc splne, addng a condton also on the second dervatve We wrte the cubc polynomal at two ndces and + buldng on the hermte polynomal results but addng a new parameter s y' s s + s y' q x y s x x x x x x x x + + ( ) ( ) x ( x ) ' ( ) ( ) ( ) ( ) ( ) = + + + + y s s + s y' q x y s x x x x x x x x ( ) ( ) + + + + + + ( ) = + + + + + + + + + x+ ( x+ ) y+ y where x = x+ x and y ' = x x + Note that regardless of the value of s, at the matchng pont x + the functon and the dervatve of the two cubcs are the same. For example, the functons are evaluated below n detals

y' s + + + x + ( ) = + ( ) + ( ) q x y s x x x x y+ y = y + s ( x x ) + s ( x x ) = y q x = y ( ) + + + + + + x+ x As an exercse you may wsh to show the contnuty of the frst dervatve We are therefore left wth the requrement of contnuous second dervatves and s that are used to obtan ths result. We have undetermned parameters { } ' q'' ( x+ ) = ( s+ + s 3y) x q '' x 3y s s ' ( ) = ( ) + + + + + x+ that must be the same. Fxng the value of s = a and sn = b we can solve a set of lnear equatons for the n- varables. These equatons provdes a pecewse contnuous representaton of the curve wth contnuous functon, and frst and second dervatves at each of the boundares. It s therefore expected to work a lot better n the nterpolaton of proten chans. Note however that the choce for s and s n s not unque and there are three dfferent ways of ntatng and termnatng a splne. The procedure we descrbed above () ( s = a and sn = b ) s called the complete splne. The other optons are: a = q'' x and b= q'' ( xn ). If both a and b are set to zero, the ft s called the natural splne. () Ensurng thrd dervatve contnuty at x and () set the values of the second dervatves at the edges to fxed numbers ( ) In Matlab all the machnery of determnng splne coeffcents s already bult n. The same beta turn can be ftted to a cubc splne (wth default parameters from Matlab) and plotted n 4 lnes: >> tt=:0.:; >> xx=splne(t,x,tt); >> yy=splne(t,y,tt); >> plot(xx,yy) The result s not truly optmal but clearly better than the polynomal ft. xn

Let us work on example for a real proten plot. We start by readng n the PDB entry par usng the functon pckca( flename ) (check the course web page for source code) coor = pckca( par.pdb ); x = coor(:,); y = coor(:,); z = coor(:,3); % straght forward plot, just connect CA plot3(x,y,z)

% here start the fancy staff t=:5; tt=:0.:5; xx=splne(t,x,tt); yy=splne(t,y,tt); zz=splne(t,z,tt); plot3(xx,yy,zz)