Classifying Pseudoknots Kyle L. Spafford. Classifying Pseudoknots -- Kyle Spafford 2 Recap – What’s a pseudoknot again? Substructure with non- nested.

Slides:



Advertisements
Similar presentations
RNA structure prediction. RNA functions RNA functions as –mRNA –rRNA –tRNA –Nuclear export –Spliceosome –Regulatory molecules (RNAi) –Enzymes –Virus –Retrotransposons.
Advertisements

Scalable and Dynamic Quorum Systems Moni Naor & Udi Wieder The Weizmann Institute of Science.
A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions Tzvika Hartman Weizmann Institute.
 Over-all: Very good idea to use more than one source. Good motivation (use of graphics). Good use of simplified, loosely defined -- but intuitive --
Lecture 24 MAS 714 Hartmut Klauck
Walks, Paths and Circuits Walks, Paths and Circuits Sanjay Jain, Lecturer, School of Computing.
Register Allocation CS 671 March 27, CS 671 – Spring Register Allocation - Motivation Consider adding two numbers together: Advantages: Fewer.
Lecture 12: Revision Lecture Dr John Levine Algorithms and Complexity March 27th 2006.
Models of Network Formation Networked Life NETS 112 Fall 2013 Prof. Michael Kearns.
Bar Ilan University And Georgia Tech Artistic Consultant: Aviya Amir.
Topological Methods for RNA Pseudoknots
Dual Marching Cubes: An Overview
Implementation of Graph Decomposition and Recursive Closures Graph Decomposition and Recursive Closures was published in 2003 by Professor Chen. The project.
Predicting RNA Structure and Function. Non coding DNA (98.5% human genome) Intergenic Repetitive elements Promoters Introns mRNA untranslated region (UTR)
. Class 1: Introduction. The Tree of Life Source: Alberts et al.
RNA Folding Xinyu Tang Bonnie Kirkpatrick. Overview Introduction to RNA Previous Work Problem Hofacker ’ s Paper Chen and Dill ’ s Paper Modeling RNA.
Particle filters (continued…). Recall Particle filters –Track state sequence x i given the measurements ( y 0, y 1, …., y i ) –Non-linear dynamics –Non-linear.
Genomic Rearrangements CS 374 – Algorithms in Biology Fall 2006 Nandhini N S.
1 Michal Ozery-Flato and Ron Shamir 2 The Genomic Sorting Problem HOW?
The Central Dogma of Molecular Biology (Things are not really this simple) Genetic information is stored in our DNA (~ 3 billion bp) The DNA of a.
. Class 5: RNA Structure Prediction. RNA types u Messenger RNA (mRNA) l Encodes protein sequences u Transfer RNA (tRNA) l Adaptor between mRNA molecules.
Finding Common RNA Pseudoknot Structures in Polynomial Time Patricia Evans University of New Brunswick.
1 Genome Rearrangements João Meidanis São Paulo, Brazil December, 2004.
The Wonderful World of RNA DNARNA protein. Complexity of RNA Folding 1 strand 1 strand 4 building blocks 4 building blocks Basic structural element: double.
Math /Algebra Talks: Mental Math Strategies
Clustering Vertices of 3D Animated Meshes
RNA Secondary Structure Prediction Introduction RNA is a single-stranded chain of the nucleotides A, C, G, and U. The string of nucleotides specifies the.
Patterns for Developing Ideas in Writing
Hellman’s TMTO 1 Hellman’s TMTO Attack. Hellman’s TMTO 2 Popcnt  Before we consider Hellman’s attack, consider simpler Time-Memory Trade-Off  “Population.
GRAPH Learning Outcomes Students should be able to:
C OMPUTATIONAL BIOLOGY. O UTLINE Proteins DNA RNA Genetics and evolution The Sequence Matching Problem RNA Sequence Matching Complexity of the Algorithms.
Programming & Data Structures
1 Bio + Informatics AAACTGCTGACCGGTAACTGAGGCCTGCCTGCAATTGCTTAACTTGGC An Overview پرتال پرتال بيوانفورماتيك ايرانيان.
RNA catalysis.
Subdivision/Refinement Dr. S.M. Malaek Assistant: M. Younesi.
Using the Margins Command to Estimate and Interpret Adjusted Predictions and Marginal Effects Richard Williams
All that remains is to connect the edges in the variable-setters to the appropriate clause-checkers in the way that we require. This is done by the convey.
AP Biology 12 Concept 1 continued: Analyzing components and reproduction cycles of viruses Please refer to: Chapter 19 in Campbell pg in Holtzclaw.
Schemata Theory Chapter 11. A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Theory Why Bother with Theory? Might provide performance.
Analysis of Algorithms Chapter 11 Instructor: Scott Kristjanson CMPT 125/125 SFU Burnaby, Fall 2013.
Lecture 10: Class Review Dr John Levine Algorithms and Complexity March 13th 2006.
RNA Secondary Structure Prediction. 16s rRNA RNA Secondary Structure Hairpin loop Junction (Multiloop)Bulge Single- Stranded Interior Loop Stem Image–
RNA Structure Prediction Including Pseudoknots Based on Stochastic Multiple Context-Free Grammar PMSB2006, June 18, Tuusula, Finland Yuki Kato, Hiroyuki.
CAP4730: Computational Structures in Computer Graphics
Regular Expressions Chapter 6 1. Regular Languages Regular Language Regular Expression Finite State Machine L Accepts 2.
Short Read Mapper Evan Zhen CS 124. Introduction Find a short sequence in a very long DNA sequence Motivation – It is easy to sequence everyone’s genome,
Unit 2: Geographical Skills
Structural Alignment of Pseudo-knotted RNA
ASHA S V BCH Ribozyme, or RNA enzyme, is a RNA molecule that act as enzymes, often found to catalyze cleavage of either its own or other RNAs.
Database Similarity Search. 2 Sequences that are similar probably have the same function Why do we care to align sequences?
Motif Search and RNA Structure Prediction Lesson 9.
C++ How to Program, 7/e © by Pearson Education, Inc. All Rights Reserved.
Shai Carmi, Erez Levanon Bar-Ilan University
Data Analytics CMIS Short Course part II Day 1 Part 1: Clustering Sam Buttrey December 2015.
1.The double helix unzips with helicase down the middle as base pairs separate. 2. DNA polymerase adds the correct complimentary nucleotide to each exposed.
VizTree Huyen Dao and Chris Ackermann. Introducing example
An Algorithm for the Consecutive Ones Property Claudio Eccher.
Rapid ab initio RNA Folding Including Pseudoknots via Graph Tree Decomposition Jizhen Zhao, Liming Cai Russell Malmberg Computer Science Plant Biology.
Review Functions. Function A function is a special type of relation in which each element of the domain is paired with exactly one element of the range.
The normal approximation for probability histograms.
Liming Cai’s Research Department of Computer Science The University of Georgia.
Yufeng Wu and Dan Gusfield University of California, Davis
NP-Completeness Yin Tat Lee
RNA Secondary Structure Prediction
On Spatial Joins in MapReduce
Objective of This Course
Arithmetic Logical Unit
Viruses Evolution Objectives:
15th Scandinavian Workshop on Algorithm Theory
Generation of an HPV–human PPI map.
Presentation transcript:

Classifying Pseudoknots Kyle L. Spafford

Classifying Pseudoknots -- Kyle Spafford 2 Recap – What’s a pseudoknot again? Substructure with non- nested base pairings Makes RNA secondary structure prediction NP- complete Looks pretty simple…

Classifying Pseudoknots -- Kyle Spafford 3 Not so simple... Quite a complex space Some simpler examples  Should they be treated as equals?

Classifying Pseudoknots -- Kyle Spafford 4 Biological Motivation In nature, things get complicated… A) Hepatitis Delta B) Diels-Alder Ribozyme C) Human telomerase D) Mouse mammary tumor virus E) pea enation mosaic virus F) Simian retrovirus

Classifying Pseudoknots -- Kyle Spafford 5 Biological Motivation Function of these pseudoknots? –Viral Frameshifting SARS, Hep C, MMTV, some HIV –Catalytically Active Genome replication Self-cleaving ribozymes Break down C-C bonds –Some things remain a mystery Telomeres, aging, and cancer

Classifying Pseudoknots -- Kyle Spafford 6 My Project Examined 3 approaches to classifying pseudoknots Looked at prevalence results for what’s been found in nature Formed an argument which explains which approach should be used in different scenarios

Classifying Pseudoknots -- Kyle Spafford 7 Patterns (from Condon et al) A pattern is a string P over some alphabet A, s.t. every element of A appears exactly twice, or not at all in P.

Classifying Pseudoknots -- Kyle Spafford 8 Patterns Classification idea - Sort pseudoknots by the algorithm(s) that can predict them Algorithms from: Uemura & Akutsu, Rivas & Eddy, Lyngso & Pederson, Dirks & Pierce Also, have a pseudoknot-free class

Classifying Pseudoknots -- Kyle Spafford 9 Patterns Pros –O(n) existence test and classification –Really easy to implement –Given a pseudoknot, if is in one of the categories (with high probability) Cons –Not very useful for biologists

Classifying Pseudoknots -- Kyle Spafford 10 Dual Graphs (from Gan et al) Represent RNA SS’s as dual graphs –Vertex - stem –Edge – single strand that may occur in segments, connects other secondary elements

Classifying Pseudoknots -- Kyle Spafford 11 Dual Graphs Classification idea – work with topological characteristics from dual graphs

Classifying Pseudoknots -- Kyle Spafford 12 Dual Graphs Pros –Very useful for biologists –Topological qualities are easy to compute Cons –Hard to specify in words –Not efficient to store –Problems with accuracy

Classifying Pseudoknots -- Kyle Spafford 13 Knot-Components (from Rodland) Simplify the complex space Find “building blocks” of pseudoknots Describe structure in a short, precise method Ignore nested substructures which complicate things

Classifying Pseudoknots -- Kyle Spafford 14 Bottom-Up Start basic – bonds –Orthodox or knotted Hairpin – P 2 The notation –Superscript: Number of stems involved in the pseudoknot –Subscript (used when not reduced): number of stem components replacing a single stem in reduced form

Classifying Pseudoknots -- Kyle Spafford 15 Knot-Components Optional second superscript when non-unique (double hairpin vs. pseudotrefoil

Classifying Pseudoknots -- Kyle Spafford 16 Top-Down

Classifying Pseudoknots -- Kyle Spafford 17 Knot-component Pros –Precise biological information –No overlap (like Condon’s system) –Mapping to Condon’s categories Cons –High learning curve –Not so easy to implement –Mapping has loss of specificity

Classifying Pseudoknots -- Kyle Spafford 18 A Brief Word on Prevalence Most pseudoknots in nature are P 5 and below Probability of finding more complex pseudoknots drops almost exponentially as superscript grows –Exception: Group II introns

Classifying Pseudoknots -- Kyle Spafford 19 When to use each system Condon’s Patterns – Large scale analysis Gan’s Dual Graphs – When you need a lot of biological information (including substructures) Rodland’s Knot-Components – Any other time

Classifying Pseudoknots -- Kyle Spafford 20 Summary Pseudoknots range from trivially simple to extraordinarily complex. They perform a myriad of exciting biological roles. Classifying them is important in determining those roles. Almost always, stick with Rodland’s knot- component system

Classifying Pseudoknots -- Kyle Spafford 21 Thank You Questions? Dying to read the paper?