what we can learn in evolution from rna molecules
play

What we can Learn in Evolution from RNA Molecules Peter Schuster - PowerPoint PPT Presentation

What we can Learn in Evolution from RNA Molecules Peter Schuster Institut fr Theoretische Chemie The Santa Fe Institute und Molekulare Strukturbiologie and Santa Fe, New Mexico USA Universitt Wien, Austria Lab Inauguration Meeting


  1. What we can Learn in Evolution from RNA Molecules Peter Schuster Institut für Theoretische Chemie The Santa Fe Institute und Molekulare Strukturbiologie and Santa Fe, New Mexico USA Universität Wien, Austria Lab Inauguration Meeting Köln, 03.12.2004

  2. Web-Page for further information: http://www.tbi.univie.ac.at/~pks

  3. 1. RNA and properties and function 2. RNA structures 3. Neutral networks and intersections 4. RNA evolution in silico 5. Intersection molecules and RNA switches 6. Neutrality in evolution and design

  4. 1. RNA and properties and function 2. RNA structures 3. Neutral networks and intersections 4. RNA evolution in silico 5. Intersection molecules and RNA switches 6. Neutrality in evolution and design

  5. RNA as transmitter of genetic information RNA as adapter molecule RNA is the catalytic subunit in RNA as scaffold for supramolecular supramolecular complexes complexes DNA RNA as catalyst transcription ...AGAGCGCCAGACUGAAGAUCUGGAGGUCCUGUGUUC... messenger- RNA . . translation . C G A leu U G C protein genetic code . . . working copy RNA as of genetic information Ribozyme ribosome ? ? ? ? ? RNA RNA is modified by epigenetic control RNA RNA editing The world as a precursor of DNA protein the current + biology RNA Alternative splicing of messenger RNA as regulator of gene expression Allosteric control of transcribed RNA RNA as carrier of genetic information RNA viruses and retroviruses RNA evolution in vitro Evolutionary biotechnology RNA aptamers, artificial ribozymes, allosteric ribozymes Riboswitches controlling Gene silencing by transcription and translation small interfering RNAs Functions of RNA molecules metabolites through

  6. Examples of ‘natural selection’ with RNA molecules

  7. An example of ‘artificial selection’ with RNA molecules or ‘breeding’ of biomolecules

  8. 1. RNA and properties and function 2. RNA structures 3. Neutral networks and intersections 4. RNA evolution in silico 5. Intersection molecules and RNA switches 6. Neutrality in evolution and design

  9. 5' - end N 1 O CH 2 O GCGGAU UUA GCUC AGUUGGGA GAGC CCAGA G CUGAAGA UCUGG AGGUC CUGUG UUCGAUC CACAG A AUUCGC ACCA 5'-end 3’-end N A U G C k = , , , OH O N 2 O P O CH 2 O Na � O O OH N 3 O P O CH 2 O Na � 3'-end O O OH Definition of RNA structure 5’-end N 4 O P O CH 2 O Na � 70 O O OH 60 3' - end O P O 10 Na � O 50 20 30 40

  10. Definition and physical relevance of RNA secondary structures RNA secondary structures are listings of Watson-Crick and GU wobble base pairs, which are free of knots and pseudokots . D.Thirumalai, N.Lee, S.A.Woodson, and D.K.Klimov. Annu.Rev.Phys.Chem . 52 :751-762 (2001): „ Secondary structures are folding intermediates in the formation of full three-dimensional structures .“

  11. The Vienna RNA-Package : A library of routines for folding, inverse folding, sequence and structure alignment, cofolding, kinetic folding, …

  12. RNA sequence Biophysical chemistry: thermodynamics and kinetics Inverse folding of RNA : RNA folding : Biotechnology, Structural biology, design of biomolecules spectroscopy of with predefined biomolecules, structures and functions Empirical parameters understanding molecular function RNA structure of minimal free energy Sequence, structure, and design

  13. 5’-end 3’-end A C (h) C S 5 (h) S 3 U (h) G C S 4 A U A U (h) S 1 U G (h) S 2 (h) C G S 8 0 G (h) (h) S 9 S 7 G C � A U y g A r A e n e (h) A S 6 C C e U e A Suboptimal conformations r U G G F C C A G G U U U G G G A C C A U G A G G G C U G (h) S 0 Minimum of free energy The minimum free energy structures on a discrete space of conformations

  14. Criterion of Minimum Free Energy UUUAGCCAGCGCGAGUCGUGCGGACGGGGUUAUCUCUGUCGGGCUAGGGCGC GUGAGCGCGGGGCACAGUUUCUCAAGGAUGUAAGUUUUUGCCGUUUAUCUGG UUAGCGAGAGAGGAGGCUUCUAGACCCAGCUCUCUGGGUCGUUGCUGAUGCG CAUUGGUGCUAAUGAUAUUAGGGCUGUAUUCCUGUAUAGCGAUCAGUGUCCG GUAGGCCCUCUUGACAUAAGAUUUUUCCAAUGGUGGGAGAUGGCCAUUGCAG Sequence Space Shape Space

  15. Reference for postulation and in silico verification of neutral networks

  16. 1. RNA and properties and function 2. RNA structures 3. Neutral networks and intersections 4. RNA evolution in silico 5. Intersection molecules and RNA switches 6. Neutrality in evolution and design

  17. ψ = ( ) Sk I. = ( ) fk f Sk Sequence space Real numbers Structure space Mapping from sequence space into structure space and into function

  18. ψ = ( ) Sk I. = ( ) fk f Sk Sequence space Real numbers Structure space

  19. ψ = ( ) Sk I. Sequence space Structure space

  20. ψ = ( ) Sk I. Sequence space Structure space The pre-image of the structure S k in sequence space is the neutral network G k

  21. CGTCGTTACAATTTA GTTATGTGCGAATTC CAAATT AAAA ACAAGAG..... G A G T CGTCGTTACAATTTA GTTATGTGCGAATTC CAAATT AAAA ACAAGAG..... A C A C Hamming distance d (I ,I ) = 4 H 1 2 (i) d (I ,I ) = 0 H 1 1 (ii) d (I ,I ) = d (I ,I ) H 1 2 H 2 1 � (iii) d (I ,I ) d (I ,I ) + d (I ,I ) H 1 3 H 1 2 H 2 3 The Hamming distance between genotypes induces a metric in sequence space

  22. Neutral networks are sets of sequences forming the same object in a phenotype space. The neutral network G k is, for example, the pre- image of the structure S k in sequence space: G k = � -1 (S k ) π { � j | � (I j ) = S k } The set is converted into a graph by connecting all sequences of Hamming distance one. Neutral networks of small biomolecules can be computed by exhaustive folding of complete sequence spaces, i.e. all RNA sequences of a given chain length. This number, N=4 n , becomes very large with increasing length, and is prohibitive for numerical computations. Neutral networks can be modelled by random graphs in sequence space. In this approach, nodes are inserted randomly into sequence space until the size of the pre-image, i.e. the number of neutral sequences, matches the neutral network to be studied.

  23. One-error neighborhood GUUAAUCAG GUAAAUCAG GUGAAUCAG GCCAAUCAG GUCUAUCAG GGCAAUCAG GUCGAUCAG GACAAUCAG GUCCAUCAG CUCAAUCAG GUCAUUCAG UUCAAUCAG G A C U G A C U G GUCAAUCAG AUCAAUCAG GUCACUCAG GUCAAUCAC GUCAAACAG GUCAAUCAU G U C A A GUCAAUCAA G C A G GUCAACCAG G U GUCAAUAAG C A G A G U U GUCAAUCUG U C C G A C C U A G A C U A A C The surrounding of U A G U U G A G GUCAAUCAG in sequence space G A G

  24. n = 9 ; 3n = 27 Degree of neutrality of neutral networks and the connectivity threshold

  25. Degree of neutrality of neutral networks and the connectivity threshold

  26. “j” λ j = / 12 27 = 0.444 Degree of neutrality of neutral networks and the connectivity threshold

  27. U � � -1 � � G S S = ( ) | ( ) = I I k k k j j � � (k) j λ k = G k | | λ j = / 12 27 = 0.444 Degree of neutrality of neutral networks and the connectivity threshold

  28. U � � -1 � � G S S = ( ) | ( ) = I I k k k j j � � (k) j λ k = G k | | λ j = / 12 27 = 0.444 λ λ G k network is connected > cr . . . . k λ λ G k not < network is connected cr . . . . k / κ - λ κ -1 ( 1) Connectivity threshold: cr = 1 - Degree of neutrality of neutral networks and the connectivity threshold

  29. U � � -1 � � G S S = ( ) | ( ) = I I k k k j j � � (k) j λ k = G k | | � Alphabet size : � � cr 2 0.5 AU,GC,DU λ j = / 12 27 = 0.444 3 0.423 AUG , UGC 4 0.370 AUGC λ λ G k network is connected > cr . . . . k λ λ G k not < network is connected cr . . . . k / κ - λ κ -1 ( 1) Connectivity threshold: cr = 1 - Degree of neutrality of neutral networks and the connectivity threshold

  30. Giant Component A multi-component neutral network formed by a rare structure

  31. A connected neutral network formed by a common structure

  32. Structure S k G k Neutral Network � G k C k Compatible Set C k The compatible set C k of a structure S k consists of all sequences which form S k as its minimum free energy structure (the neutral network G k ) or one of its suboptimal structures.

  33. (h) S 5 (h) S 1 (h) S 2 (h) (h) 0 S 9 S 7 Free energy G � (h) S 6 Suboptimal conformations Search for local minima in conformation space S h Local minimum

  34. g 3.30 49 48 47 46 45 44 42 43 41 40 38 39 36 37 34 35 33 32 31 29 30 28 27 25 26 24 23 22 21 20 0 19 1 . 3 18 S 10 17 16 15 13 14 12 S 8 S 9 10 11 5.10 S 7 9 S 5 S 6 8 7 6 5 S 4 4 S 3 3 7.40 S 2 5.90 2 S 1 S 0 S1 S0 Suboptimal structures Kinetic folding Suboptimal structures Suboptimal secondary structures of an RNA sequence

  35. g 3.30 49 48 47 46 45 44 42 43 41 40 38 39 36 37 34 35 33 32 31 29 30 28 27 25 26 24 23 22 21 20 0 19 1 . 3 18 S 10 17 16 15 13 14 12 S 8 S 9 10 11 5.10 S 7 9 S 5 S 6 8 7 6 5 S 4 4 S 3 3 7.40 S 2 5.90 2 S 1 S 0 S1 S0 Suboptimal structures Metastable Stable Kinetic folding Suboptimal structures structure An RNA molecule with two ( meta ) stable conformations

  36. Structure

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend