RNA: Secondary Structure Prediction and Analysis

Slides:



Advertisements
Similar presentations
B. Knudsen and J. Hein Department of Genetics and Ecology
Advertisements

RNA Secondary Structure Prediction
Hidden Markov Models (1)  Brief review of discrete time finite Markov Chain  Hidden Markov Model  Examples of HMM in Bioinformatics  Estimations Basic.
Two short pieces MicroRNA Alternative splicing.
MiRNA in computational biology 1 The Nobel Prize in Physiology or Medicine for 2006 Andrew Z. Fire and Craig C. Mello for their discovery of "RNA interference.
A turbo intro to (the bioinformatics of) microRNAs 11/ Peter Hagedorn.
Predicting RNA Structure and Function. Non coding DNA (98.5% human genome) Intergenic Repetitive elements Promoters Introns mRNA untranslated region (UTR)
Predicting RNA Structure and Function
RNA structure prediction. RNA functions RNA functions as –mRNA –rRNA –tRNA –Nuclear export –Spliceosome –Regulatory molecules (RNAi) –Enzymes –Virus –Retrotransposons.
Non-coding RNA William Liu CS374: Algorithms in Biology November 23, 2004.
Pattern Discovery in RNA Secondary Structure Using Affix Trees (when computer scientists meet real molecules) Giulio Pavesi& Giancarlo Mauri Dept. of Computer.
Comparative Motif Finding
Computational biology seminar
Comparative ab initio prediction of gene structures using pair HMMs
RNA Secondary Structure Prediction
Predicting RNA Structure and Function. Nobel prize 1989Nobel prize 2009 Ribozyme Ribosome RNA has many biological functions The function of the RNA molecule.
Presenting: Asher Malka Supervisor: Prof. Hermona Soreq.
Predicting RNA Structure and Function. Following the human genome sequencing there is a high interest in RNA “Just when scientists thought they had deciphered.
. Class 5: RNA Structure Prediction. RNA types u Messenger RNA (mRNA) l Encodes protein sequences u Transfer RNA (tRNA) l Adaptor between mRNA molecules.
Structural Alignment of Pseudoknotted RNAs Banu Dost, Buhm Han, Shaojie Zhang, Vineet Bafna.
Phylogenetic Shadowing Daniel L. Ong. March 9, 2005RUGS, UC Berkeley2 Abstract The human genome contains about 3 billion base pairs! Algorithms to analyze.
Predicting RNA Structure and Function
UTR motifs and microRNA analysis 曾 大 千 助 理 教 授 10/28/2008.
Predicting RNA Structure and Function. Nobel prize 1989 Nobel prize 2009 Ribozyme Ribosome.
microRNA computational prediction and analysis
Dynamic Programming (cont’d) CS 466 Saurabh Sinha.
Sequencing a genome and Basic Sequence Alignment
RNA-Seq and RNA Structure Prediction
Multiple Sequence Alignment CSC391/691 Bioinformatics Spring 2004 Fetrow/Burg/Miller (Slides by J. Burg)
RNA informatics Unit 12 BIOL221T: Advanced Bioinformatics for Biotechnology Irene Gabashvili, PhD.
Non-coding RNA gene finding problems. Outline Introduction RNA secondary structure prediction RNA sequence-structure alignment.
MicroRNA Targets Prediction and Analysis. Small RNAs play important roles The Nobel Prize in Physiology or Medicine for 2006 Andrew Z. Fire and Craig.
Transfection. What is transfection? Broadly defined, transfection is the process of artificially introducing nucleic acids (DNA or RNA) into cells, utilizing.
From Structure to Function. Given a protein structure can we predict the function of a protein when we do not have a known homolog in the database ?
RNA folding & ncRNA discovery I519 Introduction to Bioinformatics, Fall, 2012.
Applied Bioinformatics Week 11. Topics Protein Secondary Structure RNA Secondary Structure.
MicroRNA identification based on sequence and structure alignment Presented by - Neeta Jain Xiaowo Wang†, Jing Zhang†, Fei Li, Jin Gu, Tao He, Xuegong.
RNA Folding. RNA Folding Algorithms Intuitively: given a sequence, find the structure with the maximal number of base pairs For nested structures, four.
Computational Identification of Drosophila microRNA Genes Journal Club 09/05/03 Jared Bischof.
More regulating gene expression. Combinations of 3 nucleotides code for each 1 amino acid in a protein. We looked at the mechanisms of gene expression,
1 Classification of real and pseudo microRNA precursors using local structure-sequence features and support vector machine Chenghai Xue, Fei Li, Tao He,
1 RNA Bioinformatics Genes and Secondary Structure Anne Haake Rhys Price Jones & Tex Thompson.
Sequencing a genome and Basic Sequence Alignment
RNA Secondary Structure Prediction. 16s rRNA RNA Secondary Structure Hairpin loop Junction (Multiloop)Bulge Single- Stranded Interior Loop Stem Image–
© Wiley Publishing All Rights Reserved. RNA Analysis.
Lecture 9 CS5661 RNA – The “REAL nucleic acid” Motivation Concepts Structural prediction –Dot-matrix –Dynamic programming Simple cost model Energy cost.
RNA Structure Prediction
Computational Genomics and Proteomics Lecture 8 Motif Discovery C E N T R F O R I N T E G R A T I V E B I O I N F O R M A T I C S V U E.
MicroRNAs and Other Tiny Endogenous RNAs in C. elegans Annie Chiang JClub Ambros et al. Curr Biol 13:
Exploiting Conserved Structure for Faster Annotation of Non-Coding RNAs without loss of Accuracy Zasha Weinberg, and Walter L. Ruzzo Presented by: Jeff.
Questions?. Novel ncRNAs are abundant: Ex: miRNAs miRNAs were the second major story in 2001 (after the genome). Subsequently, many other non-coding genes.
Protein Synthesis Transcription.
RNA Structure Prediction RNA Structure Basics The RNA ‘Rules’ Programs and Predictions BIO520 BioinformaticsJim Lund Assigned reading: Ch. 6 from Bioinformatics:
Motif Search and RNA Structure Prediction Lesson 9.
Classification of real and pseudo microRNA precursors using local structure-sequence features and support vector machine 朱林娇 14S
MicroRNA Prediction with SCFG and MFE Structure Annotation Tim Shaw, Ying Zheng, and Bram Sebastian.
RNA Structure Prediction
Finding Motifs Vasileios Hatzivassiloglou University of Texas at Dallas.
For Prediction of microRNA Genes Vertebrate MicroRNA Genes Lee P. Lim, et. al. SCIENCE 2003 The microRNAs of Caenorhabditis elegans Lee P. Lim, et al GENES.
Rapid ab initio RNA Folding Including Pseudoknots via Graph Tree Decomposition Jizhen Zhao, Liming Cai Russell Malmberg Computer Science Plant Biology.
Network Motifs See some examples of motifs and their functionality Discuss a study that showed how a miRNA also can be integrated into motifs Today’s plan.
RNAs. RNA Basics transfer RNA (tRNA) transfer RNA (tRNA) messenger RNA (mRNA) messenger RNA (mRNA) ribosomal RNA (rRNA) ribosomal RNA (rRNA) small interfering.
Stochastic Context-Free Grammars for Modeling RNA
Predicting RNA Structure and Function
RNA Secondary Structure Prediction
RNA Secondary Structure Prediction
Stochastic Context-Free Grammars for Modeling RNA
MicroRNAs: regulators of gene expression and cell differentiation
RNA Secondary Structure Prediction
Matthew W Jones-Rhoades, David P Bartel  Molecular Cell 
Presentation transcript:

RNA: Secondary Structure Prediction and Analysis

Outline RNA Folding Dynamic Programming for RNA Secondary Structure Prediction Covariance Model for RNA Structure Prediction Small RNAs: Identification and Analysis

Section 1: RNA Folding

RNA Basics RNA bases: A,C,G,U Canonical Base Pairs A-U G-C G-U Bases can only pair with one other base.

RNA Basics RNA bases: A,C,G,U Canonical Base Pairs A-U G-C G-U Bases can only pair with one other base. 2 Hydrogen Bonds

RNA Basics RNA bases: A,C,G,U Canonical Base Pairs A-U G-C G-U Bases can only pair with one other base. 3 Hydrogen Bonds—more stable

RNA Basics RNA bases: A,C,G,U Canonical Base Pairs A-U G-C G-U Bases can only pair with one other base. “Wobble Pairing”

RNA Basics Various types of RNA: transfer RNA (tRNA) messenger RNA (mRNA) ribosomal RNA (rRNA) small interfering RNA (siRNA) micro RNA (miRNA) small nuclear RNA (snRNA) small nucleolar RNA (snoRNA) http://www.genetics.wustl.edu/eddy/tRNAscan-SE/

Section 2: Dynamic Programming for RNA Secondary Structure Prediction

RNA Secondary Structure Pseudoknot Stem Interior Loop Single-Stranded Bulge Loop Junction (Multiloop) Hairpin loop Image– Wuchty

Sequence Alignment to Determine Structure Bases pair in order to form backbones and determine the secondary structure. Aligning bases based on their ability to pair with each other gives an algorithmic approach to determining the optimal structure.

Base Pair Maximization: Dynamic Programming S(i, j) is the folding of the RNA subsequence of the strand from index i to index j which results in the highest number of base pairs. Recurrence: Images – Sean Eddy

Base Pair Maximization: Dynamic Programming S(i, j) is the folding of the RNA subsequence of the strand from index i to index j which results in the highest number of base pairs. Recurrence: Images – Sean Eddy

Base Pair Maximization: Dynamic Programming S(i, j) is the folding of the RNA subsequence of the strand from index i to index j which results in the highest number of base pairs. Recurrence: Base pair at i and j Images – Sean Eddy

Base Pair Maximization: Dynamic Programming S(i, j) is the folding of the RNA subsequence of the strand from index i to index j which results in the highest number of base pairs. Recurrence: Base pair at i and j Unmatched at i Images – Sean Eddy

Base Pair Maximization: Dynamic Programming S(i, j) is the folding of the RNA subsequence of the strand from index i to index j which results in the highest number of base pairs. Recurrence: Base pair at i and j Unmatched at i Unmatched at j Images – Sean Eddy

Base Pair Maximization: Dynamic Programming S(i, j) is the folding of the RNA subsequence of the strand from index i to index j which results in the highest number of base pairs. Recurrence: Base pair at i and j Unmatched at i Unmatched at j Bifurcation Images – Sean Eddy

Base Pair Maximization: Dynamic Programming Alignment Method: Align RNA strand to itself Score increases for feasible base pairs Each score independent of overall structure Bifurcation adds extra dimension Images—Sean Eddy Images – Sean Eddy

Base Pair Maximization: Dynamic Programming Alignment Method: Align RNA strand to itself Score increases for feasible base pairs Each score independent of overall structure Bifurcation adds extra dimension Initialize first two diagonals to 0 Images—Sean Eddy Images – Sean Eddy

Base Pair Maximization: Dynamic Programming Alignment Method: Align RNA strand to itself Score increases for feasible base pairs Each score independent of overall structure Bifurcation adds extra dimension Fill in squares sweeping diagonally Images—Sean Eddy Images – Sean Eddy

Base Pair Maximization: Dynamic Programming Alignment Method: Align RNA strand to itself Score increases for feasible base pairs Each score independent of overall structure Bifurcation adds extra dimension Fill in squares sweeping diagonally Images—Sean Eddy Images – Sean Eddy

Base Pair Maximization: Dynamic Programming Alignment Method: Align RNA strand to itself Score increases for feasible base pairs Each score independent of overall structure Bifurcation adds extra dimension Bases cannot pair Images—Sean Eddy Images – Sean Eddy

Base Pair Maximization: Dynamic Programming Alignment Method: Align RNA strand to itself Score increases for feasible base pairs Each score independent of overall structure Bifurcation adds extra dimension Bases can pair, similar to matched alignment Images—Sean Eddy Images – Sean Eddy

Base Pair Maximization: Dynamic Programming Alignment Method: Align RNA strand to itself Score increases for feasible base pairs Each score independent of overall structure Bifurcation adds extra dimension Dynamic Programming—possible paths Images—Sean Eddy Images – Sean Eddy

Base Pair Maximization: Dynamic Programming Alignment Method: Align RNA strand to itself Score increases for feasible base pairs Each score independent of overall structure Bifurcation adds extra dimension S(i, j – 1) Dynamic Programming—possible paths Images—Sean Eddy Images – Sean Eddy

Base Pair Maximization: Dynamic Programming Alignment Method: Align RNA strand to itself Score increases for feasible base pairs Each score independent of overall structure Bifurcation adds extra dimension S(i + 1, j) Dynamic Programming—possible paths Images—Sean Eddy Images – Sean Eddy

Base Pair Maximization: Dynamic Programming Alignment Method: Align RNA strand to itself Score increases for feasible base pairs Each score independent of overall structure Bifurcation adds extra dimension Dynamic Programming—possible paths S(i + 1, j – 1) +1 Images—Sean Eddy

Base Pair Maximization: Dynamic Programming Alignment Method: Align RNA strand to itself Score increases for feasible base pairs Each score independent of overall structure Bifurcation adds extra dimension Bifurcation—add values for all k Images—Sean Eddy

Base Pair Maximization: Dynamic Programming Alignment Method: Align RNA strand to itself Score increases for feasible base pairs Each score independent of overall structure Bifurcation adds extra dimension Bifurcation—add values for all k Images—Sean Eddy

Base Pair Maximization: Dynamic Programming Alignment Method: Align RNA strand to itself Score increases for feasible base pairs Each score independent of overall structure Bifurcation adds extra dimension Bifurcation—add values for all k Images—Sean Eddy

Base Pair Maximization: Dynamic Programming Alignment Method: Align RNA strand to itself Score increases for feasible base pairs Each score independent of overall structure Bifurcation adds extra dimension Bifurcation—add values for all k Images—Sean Eddy

Base Pair Maximization: Drawbacks Base pair maximization will not necessarily lead to the most stable structure. It may create structure with many interior loops or hairpins which are energetically unfavorable. In comparison to aligning sequences with scattered matches—not biologically reasonable.

Energy Minimization Thermodynamic Stability Estimated using experimental techniques. Theory : Most Stable = Most likely No pseudoknots due to algorithm limitations. Attempts to maximize the score, taking thermodynamics into account. MFOLD and ViennaRNA

Energy Minimization Results Linear RNA strand folded back on itself to create secondary structure Circularized representation uses this requirement Arcs represent base pairing Images – David Mount

Energy Minimization Results All loops must have exactly three bases in them. Equivalent to having at least three base pairs between arc endpoints. Images – David Mount

Energy Minimization Results All loops must have exactly three bases in them. Equivalent to having at least three base pairs between arc endpoints. Images – David Mount

Energy Minimization Results All loops must have exactly three bases in them. Exception: Location where beginning and end of RNA come together in circularized representation. Images – David Mount

Energy Minimization Results All loops must have exactly three bases in them. Exception: Location where beginning and end of RNA come together in circularized representation. Images – David Mount

Trouble with Pseudoknots Pseudoknots cause a breakdown in the dynamic programming algorithm. In order to form a pseudoknot, checks must be made to ensure base is not already paired—this breaks down the recurrence relations. Images – David Mount

Trouble with Pseudoknots Pseudoknots cause a breakdown in the dynamic programming algorithm. In order to form a pseudoknot, checks must be made to ensure base is not already paired—this breaks down the recurrence relations. Images – David Mount

Trouble with Pseudoknots Pseudoknots cause a breakdown in the dynamic programming algorithm. In order to form a pseudoknot, checks must be made to ensure base is not already paired—this breaks down the recurrence relations. Images – David Mount

Energy Minimization: Drawbacks Computes only one optimal structure. Optimal solution may not represent the biologically correct solution.

Section 3: Covariance Model for RNA Structure Prediction

Alternative Algorithms - Covariaton Incorporates Similarity-based method Evolution maintains sequences that are important Change in sequence coincides to maintain structure through base pairs (Covariance) Cross-species structure conservation example – tRNA Manual and automated approaches have been used to identify covarying base pairs Models for structure based on results Ordered Tree Model Stochastic Context Free Grammar

Alternative Algorithms - Covariaton Expect areas of base pairing in tRNA to be covarying between various species.

Alternative Algorithms - Covariaton Expect areas of base pairing in tRNA to be covarying between various species. Base pairing creates same stable tRNA structure in organisms.

Alternative Algorithms - Covariaton Expect areas of base pairing in tRNA to be covarying between various species. Base pairing creates same stable tRNA structure in organisms. Mutation in one base yields pairing impossible and breaks down structure.

Alternative Algorithms - Covariaton Expect areas of base pairing in tRNA to be covarying between various species. Base pairing creates same stable tRNA structure in organisms. Mutation in one base yields pairing impossible and breaks down structure. Covariation ensures ability to base pair is maintained and RNA structure is conserved.

Binary Tree Representation of RNA Secondary Structure Representation of RNA structure using Binary tree Nodes represent Base pair if two bases are shown Loop if base and “gap” (dash) are shown Pseudoknots still not represented Tree does not permit varying sequences Mismatches Insertions & Deletions Images – Eddy et al.

Binary Tree Representation of RNA Secondary Structure Representation of RNA structure using Binary tree Nodes represent Base pair if two bases are shown Loop if base and “gap” (dash) are shown Pseudoknots still not represented Tree does not permit varying sequences Mismatches Insertions & Deletions Images – Eddy et al.

Binary Tree Representation of RNA Secondary Structure Representation of RNA structure using Binary tree Nodes represent Base pair if two bases are shown Loop if base and “gap” (dash) are shown Pseudoknots still not represented Tree does not permit varying sequences Mismatches Insertions & Deletions Images – Eddy et al.

Binary Tree Representation of RNA Secondary Structure Representation of RNA structure using Binary tree Nodes represent Base pair if two bases are shown Loop if base and “gap” (dash) are shown Pseudoknots still not represented Tree does not permit varying sequences Mismatches Insertions & Deletions Images – Eddy et al.

Covariance Model Covariance Model: HMM which permits flexible alignment to an RNA structure – emission and transition probabilities Model trees based on finite number of states Match states – sequence conforms to the model: MATP: State in which bases are paired in the model and sequence. MATL & MATR: State in which either right or left bulges in the sequence and the model. Deletion – State in which there is deletion in the sequence when compared to the model. Insertion – State in which there is an insertion relative to model.

Covariance Model Covariance Model: HMM which permits flexible alignment to an RNA structure – emission and transition probabilities Transitions have probabilities. Varying probability: Enter insertion, remain in current state, etc. Bifurcation: No probability, describes path.

Covariance Model (CM) Training Algorithm S(i, j) = Score at indices i and j in RNA when aligned to the Covariance Model. Frequencies obtained by aligning model to “training data”—consists of sample sequences. Reflect values which optimize alignment of sequences to model.

Covariance Model (CM) Training Algorithm S(i, j) = Score at indices i and j in RNA when aligned to the Covariance Model. Frequencies obtained by aligning model to “training data”—consists of sample sequences. Reflect values which optimize alignment of sequences to model. Frequency of seeing the symbols (A, C, G, T) together in locations i and j depending on symbol.

Covariance Model (CM) Training Algorithm S(i, j) = Score at indices i and j in RNA when aligned to the Covariance Model. Frequencies obtained by aligning model to “training data”—consists of sample sequences. Reflect values which optimize alignment of sequences to model. Independent frequency of seeing the symbols (A, C, G, T) in locations i or j depending on symbol.

Covariance Model (CM) Training Algorithm S(i, j) = Score at indices i and j in RNA when aligned to the Covariance Model. Frequencies obtained by aligning model to “training data”—consists of sample sequences. Reflect values which optimize alignment of sequences to model. Independent frequency of seeing the symbols (A, C, G, T) in locations i or j depending on symbol.

Alignment to CM Algorithm Calculate the probability score of aligning RNA to CM. Three dimensional matrix—O(n³) Align sequence to given subtrees in CM. For each subsequence, calculate all possible states. Subtrees evolve from bifurcations For simplicity, left singlet is default. Images—Eddy et al.

Alignment to CM Algorithm For each calculation, take into account: Transition (T) to next state. Emission probability (P) in the state as determined by training data. Images—Eddy et al.

Alignment to CM Algorithm For each calculation, take into account: Transition (T) to next state. Emission probability (P) in the state as determined by training data. Images—Eddy et al.

Alignment to CM Algorithm For each calculation, take into account: Transition (T) to next state. Emission probability (P) in the state as determined by training data. Images—Eddy et al.

Alignment to CM Algorithm For each calculation, take into account: Transition (T) to next state. Emission probability (P) in the state as determined by training data. Deletion—does not have emission probability associated with it. Images—Eddy et al.

Alignment to CM Algorithm For each calculation, take into account: Transition (T) to next state. Emission probability (P) in the state as determined by training data. Deletion—does not have emission probability associated with it. Bifurcation—does not have state probability associated with it. Images—Eddy et al.

Covariance Model Drawbacks Needs to be well trained. Not suitable for searches of large RNA. Structural complexity of large RNA cannot be modeled Runtime Memory requirements

Section 4: Small RNAs: Identification and Analysis

Discovery of small RNAs Rosalind Lee The first small RNA: In 1993 Rosalind Lee was studying a non- coding gene in C. elegans, lin-4, that was involved in silencing of another gene, lin-14, at the appropriate time in the development of the worm C. elegans. Two small transcripts of lin-4 (22nt and 61nt) were found to be complementary to a sequence in the 3' UTR of lin-14. Because lin-4 encoded no protein, she deduced that it must be these transcripts that are causing the silencing by RNA-RNA interactions. The second small RNA wasn't discovered until 2000!

What are small ncRNAs? Two flavors of small non-coding RNA: micro RNA (miRNA) short interfering RNA (siRNA) Properties of small non-coding RNA: Involved in silencing other mRNA transcripts. Called “small” because they are usually only about 21-24 nucleotides long. Synthesized by first cutting up longer precursor sequences (like the 61nt one that Lee discovered). Silence an mRNA by base pairing with some sequence on the mRNA.

miRNA Pathway Illustration

siRNA Pathway Illustration Complementary base pairing facilitates the mRNA cleavage

Features of miRNAs Hundreds miRNA genes are already identified in human genome. Most miRNAs start with a U The second 7-mer on the 5' end is known as the “seed.” When an miRNAs bind to their targets, the seed sequence has perfect or near-perfect alignment to some part of the target sequence. Example: UGAGCUUAGCAG...

Features of miRNAs Many miRNAs are conserved across species: For half of known human miRNAs, >18% of all occurrences of one of these miRNA seeds are conserved among human, dog, rat, and mouse. As a rule, the full sequence of miRNAs is almost never completely complementary to the target sequence. Common to see a loop or bulge after the seed when binding. Loop/bulge is often a hairpin because of stability. The site at which miRNAs attack is often in their target's 3' UTR.

miRNA Binding Bulges The MRE is known as the “miRNA recognition element.” This is simply the sequence in the target that an miRNA binds to Hairpin is more stable than a simple bulge

Locating miRNA Genes: Experimentally Locating miRNA experimentally is difficult. Procedure: Find a gene that causes down-regulation of another gene. Determine if no protein is encoded. Analyze the sequence to determine if it is complementary to its target.

Locating miRNA Genes: Comparative Genomics Idea: Find the seed binding sites. Examine well-conserved 3' UTRs among species to find well-conserved 8-mers (A + seed) that might be an miRNA target sequence. Look for a sequence complementary to this 8-mer to identify a potential miRNA seed. Once found, check flanking sequence to see if any stable hairpin structures can form—these are potentially pre-miRNAs. To determine the possibility of secondary RNA structure, use RNAfold.

Locating miRNA Genes: Example Suppose you found a well-conserved 8-mer in 3' UTRs (this could be where an miRNA seed binds in its target). Example: AGACTAGG Look elsewhere in genome for complementary sequence (this could be an miRNA seed). Example: TCTGATCC When TCTGATCC is found, check to see (with RNAfold) if the sequences around it could form hairpin; if so, this could be an miRNA gene.

Finding miRNA Targets: Method 1 Now we know of some miRNAs, but where do they attack? Goal: Find the targets of a set of miRNAs that are shared between human and mouse. Looking for the miRNA recognition element (MRE), not whole mRNA. This is just the part that the miRNA would bind to. Basic Assumption: Whole miRNA:MRE interactions (binding) are likely to have highly energetically favorable base pairing. Basic Method: Look through the conserved 3' UTRs—this is where the MREs are most likely to be located—and try to make an alignment that minimizes the binding energy between the miRNA sequence and the UTRs (most favorable).

Finding miRNA Targets: Method 1 First look at the binding energies of all 38-mers of the mRNA when binding to the miRNA. Subsequently apply several filters to pick alignments that “look” like miRNA binding. Why 38-mers? ~22 nt for the miRNA and the rest to allow for bulges, loops, etc. Algorithm: Use a modified dynamic programming sequence alignment algorithm to calculate the binding energies for each 38-mer. Modifications: Scoring and speedup

Finding miRNA Targets: Method 1 Scoring: Mismatches and indels allowed. Matrix based on RNA-RNA binding energies. Use known binding energies of Watson-Crick pairing and wobble (G-U) pairing. Binding energy (score) calculated for every two adjacent pairings (unlike the standard alignment algorithm which just takes into account the “score” for one pair at a time). Adds dimensions to scoring matrix. Adds complexity to recurrence relation.

Finding miRNA targets: Method 2 Goal: Find the set of miRNA targets for miRNAs shared across multiple species Trying to identify which genes have 3' UTRs are attacked by miRNAs Basic Assumptions: There is perfect binding to the miRNA seed. Any leftover sequence wants to achieve optimal RNA secondary structure. Basic Method: For each species’ set of 3' UTRs, find sites where there is perfect binding of the miRNA seed and “optimal folding” nearby. Look for agreement among all the species.

Method 2: Example

Method 2: Steps Find a perfect match to the miRNA seed. Extend the matching region if possible. Find the optimal folding for the remaining sequences. Calculate the energy of this interaction.

Method 2: Details Input: A set of miRNAs conserved among species and a set of 3' UTR sequences for those species. Method: For each organism: Find all occurrences in the UTR sequences that match the miRNA seed exactly. Extend this region with perfect or wobble pairings. With the remaining sequence of the miRNA, use the program RNAfold to find optimal folding with the next 35 bases of the UTR sequence. Calculate a score for this interaction based on the free energy of the interaction given by RNAfold.

Method 2: Details Method Cont.: Sum up the scores of all interactions for each UTR. Rank all the organism's gene's UTRs by this score (sum of all interactions in that UTR). Repeat the above steps for each organism. Create a cutoff score and a cutoff rank for the UTRs. Select the set of genes where the orthologous genes across all the sampled species have UTR's that score and rank above this cutoff.

Method 2: Details Verification: Find the number of predicted binding sites per miRNA. Compare it to number of binding sites for a randomly generated miRNA. The result is much higher.

Analysis of the Two Methods Good at identifying very strong, highly complementary miRNA targets. Found gene targets with one miRNA binding site, failed to identify genes with multiple weaker binding sites. Method 2: Good at identifying gene targets that have many weaker interactions. Fails to identify single-site genes.

Analysis of the Two Methods Both Methods: Speed is an issue. Won't find targets that aren't in the 3' UTR of a gene. We need more species sequenced! Conserved sequences are used to discover small RNAs. Conserved small RNAs are used to discover targets. Confidence in prediction of small RNAs and targets. Allows for broader scope with different combinations of species.

Results Predicted a large portion of already known targets and provided direction for identifying undiscovered targets. Found that it is more common that genes are regulated by multiple small RNAs. Found that many small RNAs have multiple targets.

A Novel siRNA Mechanism Recently, a new mechanism of siRNA activity was discovered. Two genes (called A and B here) that have a cis-antisense orientation (they are overlapping on opposite strands) have transcripts that produce an siRNA due to the dsRNA formed by their mRNA transcripts. Gene A is constitutive, gene B is induced by salt stress Normally, just B's transcript is present. When both A and B are present, we get annealing to get dsRNA and this forms an siRNA. Since the siRNA is complementary to gene A's transcript, the siRNA attacks gene A, silencing it. These genes might provide direction to finding new siRNAs.

Pathway: Illustration Annealing of transcripts nicely sets up the dsRNA to be used later in making the siRNA Both transcripts present if salt is present “A” “B” siRNA silences A

References How Do RNA Folding Algorithms Work?. S.R. Eddy. Nature Biotechnology, 22:1457-1458, 2004. Borsani, O., Zhu, J, Verslues, P.E., Sunkar, R., Zhu, J.-K. (2005). Endogenous siRNAs Derived From a Pair of Natural cis-Antisense Transcripts Regulate Solt Tolerance in Arabidopsis. Cell 123, Jury, W.A. and Vaux Jr., H. (2005). The role of science in solving the world's emerging water problems. Proc. Natl Acad. Sci. USA 102: 15715-15720.

References Kiriakidou, M., Nelson, P.T., Kouranov, A., Fitziev, P., Bouyioukos, C., Hatzigeorgiou, A., and Hatzigeorgiou, M. (2004). A combined computational-experimental approach predicts human microRNA targets. Genes & Dev. 18: 1165-1178. Lee, R.C., Feinbaum, R.L., and Ambros, V. (1993). The C. elegans Heterochronic Gene lin-4 Encodes Small RNAs with Antisense Complementarity to lin-14. Cell 75: 843-854.

References Lee, Y. Kim, M, Han, J. Yeom, K-H, Lee, S., Baek, S.H., and Kim, V.N. (2004). MicroRNA genes are transcribed by RNA polymerase II. The EMBO Journal 23: 4051-4060. Lewis, B.P., Shih, I., Jones-Rhoades, M.W., Bartel, D.P., and Burge, C.B. (2003). Prediction of Mammalian MicroRNA Targets. Cell 115: 787-798.

References Xie, X, Lu, J, Kulbokas, E.J., Golub, T.R., Mootha, V., Lindblad-Toh, K., Lander, E.S., and Kellis, M. (2005). Systematic discovery of regulatory motifs in human promoters and 30 UTRs by comparison of several mammals. Nature 443: 338-345.