RNAFolding

# RNAFolding - RNA Folding Algorithms BioE131 Ian Holmes Free...

This preview shows pages 1–8. Sign up to view the full content.

RNA Folding Algorithms BioE131, Ian Holmes

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Free energy of RNA folding
Watson-Crick base pairing

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Nussinov Algorithm γ (i,j) is the max number of basepairs in subsequence i. .j ∂(i,j) is 1 iff (i,j) form a basepair
Example implementation For j = 1 to L (in ascending order) Set γ (j,j) = 0 If j>1: Set γ (j-1,j) = δ (j-1,j) If j>2: For i = j-2 to 1 (in descending order) Set γ (i,j) = For k = i+1 to j-1 (in ascending order) Set γ (i,j) = max g i +1, j - 1 ( ) + d i , j ( ) g i +1, j ( ) g i , j - 1 ( ) ae è ç ç ç ö ø ÷ ÷ ÷ max g ( i , j ) g ( i , k ) + g ( k +1, j ) ae è ç ö ø ÷ Rate-limiting step

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Nussinov: memory complexity Number of stored values γ (i,j) is using the result. .. n n =1 N å = 1 2 N ( N +1) 1= 1 2 L 2 j = i +2 L å i =1 L å - 3 2 L
Asymptotic memory complexity Number of stored values γ (i,j) is For sufficiently large L, the L 2 term will come to dominate the coefficient (1/2) will be irrelevant if we compare to other powers of L (e.g. L, L 3 , L 4 ) 1= 1 2 L 2 j = i +2 L å i =1 L å - 3 2 L

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 21

RNAFolding - RNA Folding Algorithms BioE131 Ian Holmes Free...

This preview shows document pages 1 - 8. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online