pseudoknot prediction
play

Pseudoknot Prediction like Zuker algorithm, but without restriction - PowerPoint PPT Presentation

Mar 29, 2024 •274 likes •469 views

Pseudoknot Prediction like Zuker algorithm, but without restriction to nested structures no method for arbitrary pseudoknot available (NP-hard) BUT: pseudoknot base-pair maximization NOT NP-hard! Lyngso and Pedersen. RECOMB, 2000: NP-hard

  1. Pseudoknot Prediction • like Zuker algorithm, but without restriction to nested structures • no method for arbitrary pseudoknot available (NP-hard) BUT: pseudoknot base-pair maximization NOT NP-hard! Lyngso and Pedersen. RECOMB, 2000: NP-hard in “nearest neighbor model” by reduction to 3SAT. implies NP-hard for loop-based models ⇒ restrict complexity of pseudoknots (then, solve efficiently) S.Will, 18.417, Fall 2011

  2. Pseudoknot Types • Simple, H-type 1 1 10 10 20 20 1 10 20 • Kissing Hairpin 20 10 1 10 20 1 • Three-knot S.Will, 18.417, Fall 2011 5 20 15 10 1 10 15 1 5 20

  3. Pseudoknot Prediction • algorithms for several restricted classes of pseudoknots: class R&G A/U L&P D&P CCJ R&E O ( n 4 ) O ( n 4 )/ O ( n 5 ) O ( n 5 ) O ( n 5 ) O ( n 5 ) O ( n 6 ) time O ( n 2 ) O ( n 3 )/ O ( n 3 ) O ( n 3 ) O ( n 4 ) O ( n 4 ) O ( n 4 ) space • R&G (Reeder-Giegerich) is most restricted class of pseudoknots → fastest algorithm (PKnotsRG) • R&E (Rivas-Eddy) is most general class of pseudoknots → slowest algorithm S.Will, 18.417, Fall 2011

  4. Pseudoknot Prediction: General Idea Like Zuker algorithm cases for different loops: { additional cases for pseudoknots using fragments with gaps: + = separate recursion for gapped fragments necessary: { ... S.Will, 18.417, Fall 2011 • in practice many different types of gapped fragments necessary (e.g. with/without base pair outside/around the gap) • exact recursion is different for each of the algorithms

  5. Only One Gap: R&E Idea of R&E: • all you can do with restriction “only one gap”; for example: + = • loop-based energy model ⇒ combinatorial blow-up • energy parameters for pk-loops? • all cases with “only one gap” fragments ⇒ specific computational complexity ⇒ R&E is the most complex, still “reasonably” efficient PK-prediction algorithm based on DP S.Will, 18.417, Fall 2011

  6. Efficiently Decomposable Pseudoknots • Simple, H-type (Akutsu (A/U), O ( n 4 ) / O ( n 3 )) 1 10 20 • Kissing Hairpin (Chen, Condon, Jabbari (CCJ), O ( n 5 ) / O ( n 4 )) • Three-knot (Rivas-Eddy O ( n 6 ) / O ( n 4 )) • Closed Five-chain ( O ( n ? )) S.Will, 18.417, Fall 2011

  7. Efficiently Decomposable Pseudoknots • Simple, H-type (Akutsu (A/U), O ( n 4 ) / O ( n 3 )) • Kissing Hairpin (Chen, Condon, Jabbari (CCJ), O ( n 5 ) / O ( n 4 )) 10 1 20 • Three-knot (Rivas-Eddy O ( n 6 ) / O ( n 4 )) • Closed Five-chain ( O ( n ? )) S.Will, 18.417, Fall 2011

  8. Efficiently Decomposable Pseudoknots • Simple, H-type (Akutsu (A/U), O ( n 4 ) / O ( n 3 )) • Kissing Hairpin (Chen, Condon, Jabbari (CCJ), O ( n 5 ) / O ( n 4 )) 10 1 20 • Three-knot (Rivas-Eddy O ( n 6 ) / O ( n 4 )) • Closed Five-chain ( O ( n ? )) S.Will, 18.417, Fall 2011

  9. Efficiently Decomposable Pseudoknots • Simple, H-type (Akutsu (A/U), O ( n 4 ) / O ( n 3 )) • Kissing Hairpin (Chen, Condon, Jabbari (CCJ), O ( n 5 ) / O ( n 4 )) • Three-knot (Rivas-Eddy O ( n 6 ) / O ( n 4 )) 1 5 10 15 20 • Closed Five-chain ( O ( n ? )) S.Will, 18.417, Fall 2011

  10. Efficiently Decomposable Pseudoknots • Simple, H-type (Akutsu (A/U), O ( n 4 ) / O ( n 3 )) • Kissing Hairpin (Chen, Condon, Jabbari (CCJ), O ( n 5 ) / O ( n 4 )) • Three-knot (Rivas-Eddy O ( n 6 ) / O ( n 4 )) 1 10 20 • Closed Five-chain ( O ( n ? )) S.Will, 18.417, Fall 2011

  11. Efficiently Decomposable Pseudoknots • Simple, H-type (Akutsu (A/U), O ( n 4 ) / O ( n 3 )) • Kissing Hairpin (Chen, Condon, Jabbari (CCJ), O ( n 5 ) / O ( n 4 )) • Three-knot (Rivas-Eddy O ( n 6 ) / O ( n 4 )) • Closed Five-chain ( O ( n ? )) S.Will, 18.417, Fall 2011

  12. Efficiently Decomposable Pseudoknots • Simple, H-type (Akutsu (A/U), O ( n 4 ) / O ( n 3 )) • Kissing Hairpin (Chen, Condon, Jabbari (CCJ), O ( n 5 ) / O ( n 4 )) • Three-knot (Rivas-Eddy O ( n 6 ) / O ( n 4 )) • Closed Five-chain ( O ( n ? )) S.Will, 18.417, Fall 2011

  13. Very Efficient Pseudoknot Prediction: PKnotsRG PKnotsRG is restricted to canonical pseudoknots A canonical stem with outermost base pair ( i , j ) consists of the base pairs ( i + k , j − k ), k ≥ 0 such that for all 0 ≤ k ′ ≤ k ( i + k ′ , j − k ′ ) is a valid Watson Crick base pair. A canonical pseudoknot consists of two crossing canonical stems. Example Canonical pseudoknot with outermost base pairs ( i , j ) , ( i ′ , j ′ ) GAGACACGAGCUAUUGCGGAUCGUAGCUUAGCUCGUUCCCGAUCAGUGC S.Will, 18.417, Fall 2011 .....i............i’...............j.......j’....

  14. Very Efficient Pseudoknot Prediction: PKnotsRG PKnotsRG is restricted to canonical pseudoknots A canonical stem with outermost base pair ( i , j ) consists of the base pairs ( i + k , j − k ), k ≥ 0 such that for all 0 ≤ k ′ ≤ k ( i + k ′ , j − k ′ ) is a valid Watson Crick base pair. A canonical pseudoknot consists of two crossing canonical stems. Example Canonical pseudoknot with outermost base pairs ( i , j ) , ( i ′ , j ′ ) .....((((((((.....[[[[[.....))))))))...]]]]]..... GAGACACGAGCUAUUGCGGAUCGUAGCUUAGCUCGUUCCCGAUCAGUGC S.Will, 18.417, Fall 2011 .....i............i’...............j.......j’....

  15. Very Efficient Pseudoknot Prediction: PKnotsRG • canonical pseudoknots are likely to occur (stable) • a sequence contains only O ( n 4 ) canonical pseudoknots • limitations: only 2 stems, no bulges,. . . PKnotsRG = Zuker recursion with one additional pseudoknot case { i j for all i' and j' for d1, d2 such that the ... ... ... ... S.Will, 18.417, Fall 2011 j stems are cannonical i j' i' d1 d2 d1 d2 → O ( n 4 ) time, O ( n 2 ) space. −

  16. Efficient (DP) Pseudoknot Prediction: Literature E. Rivas, S. R. Eddy, A dynamic programming algorithm for RNA structure prediction including pseudoknots,JMB 1999 Rune B. Lyngso, Christian N. S. Pedersen, Pseudoknots in RNA Secondary Structures, RECOMB 2000 T. Akutsu, Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots,DAM 2000 Robert M. Dirks, Niles A. Pierce, A partition function algorithm for nucleic acid secondary structure including pseudoknots, JCC 2003 Jens Reeder, Robert Giegerich,Design, implementation and evaluation of a practical pseudoknot folding algorithm based on thermodynamics, PNAS 2004 Anne Condon, Beth Davy, Baharak Rastegari, Shelly Zhao, Finbarr S.Will, 18.417, Fall 2011 Tarrant,Classifying RNA pseudoknotted structures, TCS 2004 Ho-Lin Chen, Anne Condon, Hosna Jabbari ,An O(n(5)) Algorithm for MFE Prediction of Kissing Hairpins and 4-Chains in Nucleic Acids, JCB 2009

  17. Heuristic Pseudoknot-Prediction • ILM (Iterated Loop Matching) Ruan,J., Stormo,G. and Zhang,W. An iterated loop matching approach to the prediction of RNA secondary structures with pseudoknots. Bioinformatics, 2004. • iterates Nussinov-like algorithm: “hierarchical folding” • least commitment strategy: keep only most reliable stem • HotKnots Jihong Ren, Baharak Rastegari, Anne Condon, and Holger H. Hoos. Hotknots: Heuristic prediction of RNA secondary structures including pseudoknots. RNA 2005 S.Will, 18.417, Fall 2011 • Select “hot spots” = simple secondary structure elements with good energy • Iteratively add elements to final structure

  18. Why Heuristics Pseudoknot Prediction? • Speed: DP-Algos for most general cases are expensive • Accuracy: can all effect be covered in the loop-based model? For example simple H-type pseudoknots: Song Cao and Shi-Jie Chen* Predicting RNA pseudoknot folding thermodynamics S.Will, 18.417, Fall 2011 (a) Loops L1 and L2 span the deep narrow (major) and the shallow wide (minor) grooves, respectively. (b) gene 32 mRNA pseudoknot of bacteriophage T2 and (c) corresponding atomic structure from NMR structure (PDB ID: 2TPK).

Recommend

DNA STRAND DISPLACEMENT DNA STRAND DISPLACEMENT = Adenine = long domain = Thymine = short

DNA STRAND DISPLACEMENT DNA STRAND DISPLACEMENT = Adenine = long domain = Thymine = short

16 th 1 ENUMERATION, CONDENSATION AND SIMULATION ENUMERATION, CONDENSATION AND SIMULATION OF PSEUDOKNOT-FREE OF PSEUDOKNOT-FREE DOMAIN-LEVEL DNA STRAND DISPLACEMENT SYSTEMS DOMAIN-LEVEL DNA STRAND DISPLACEMENT SYSTEMS Stefan Badelt , Casey

953 views • 37 slides
Using Stata 16s lasso features for prediction and inference Di Liu StataCorp 1 / 50

Using Stata 16s lasso features for prediction and inference Di Liu StataCorp 1 / 50

Using Stata 16s lasso features for prediction and inference Di Liu StataCorp 1 / 50 Motivation I: Prediction What is a prediction? Prediction is to predict an outcome variable on new (unseen) data Good prediction minimizes mean-squared

763 views • 53 slides
Using lasso and related estimators for prediction Di Liu StataCorp July 12, 2019 1 / 20

Using lasso and related estimators for prediction Di Liu StataCorp July 12, 2019 1 / 20

Using lasso and related estimators for prediction Di Liu StataCorp July 12, 2019 1 / 20 Prediction What is a prediction? Prediction is to predict an outcome variable on new (unseen) data Good prediction minimizes mean-squared error (or other

217 views • 20 slides
Structured Prediction Introduction What is structured prediction? CS 6355: Structured Prediction

Structured Prediction Introduction What is structured prediction? CS 6355: Structured Prediction

Structured Prediction Introduction What is structured prediction? CS 6355: Structured Prediction Our goal today To define a Structure and Structured Prediction 1 What are structures? 2 Examples of structured data? 3 Examples of structured

661 views • 34 slides
A prediction is not a decision -- it is only a component of a decision. Prediction

A prediction is not a decision -- it is only a component of a decision. Prediction

A prediction is not a decision -- it is only a component of a decision. Prediction Machines , Agarwal, et.al. ? Prediction + Judgement = Decision "Open the pod bay doors, Hal" 2001: A Space Odyssey How far should we go?

327 views • 6 slides
Summary of part I: prediction and RL Prediction is important for action selection The

Summary of part I: prediction and RL Prediction is important for action selection The

Summary of part I: prediction and RL Prediction is important for action selection The problem: prediction of future reward The algorithm: temporal difference learning Neural implementation: dopamine dependent learning in BG A

939 views • 60 slides
Prediction and Odds 18.05 Spring 2017 Probabilistic Prediction Also called probabilistic

Prediction and Odds 18.05 Spring 2017 Probabilistic Prediction Also called probabilistic

Prediction and Odds 18.05 Spring 2017 Probabilistic Prediction Also called probabilistic forecasting. Assign a probability to each outcome of a future experiment. Prediction: It will rain tomorrow. Probabilistic prediction: Tomorrow it

480 views • 26 slides
Prediction and Odds 18.05 Spring 2014 January 1, 2017 1 / 20 Probabilistic Prediction Also

Prediction and Odds 18.05 Spring 2014 January 1, 2017 1 / 20 Probabilistic Prediction Also

Prediction and Odds 18.05 Spring 2014 January 1, 2017 1 / 20 Probabilistic Prediction Also called probabilistic forecasting. Assign a probability to each outcome of a future experiment. Prediction: It will rain tomorrow. Probabilistic

349 views • 20 slides
Prediction and Odds 18.05 Spring 2014 January 1, 2017 1 / 26 Probabilistic Prediction Also

Prediction and Odds 18.05 Spring 2014 January 1, 2017 1 / 26 Probabilistic Prediction Also

Prediction and Odds 18.05 Spring 2014 January 1, 2017 1 / 26 Probabilistic Prediction Also called probabilistic forecasting. Assign a probability to each outcome of a future experiment. Prediction: It will rain tomorrow. Probabilistic

692 views • 26 slides
Prediction of RNA-RNA-Interaction 20 1 15 1 5 10 20 5 10 20 15 10 1 15 5 1 20 10

Prediction of RNA-RNA-Interaction 20 1 15 1 5 10 20 5 10 20 15 10 1 15 5 1 20 10

Prediction of RNA-RNA-Interaction 20 1 15 1 5 10 20 5 10 20 15 10 1 15 5 1 20 10 Can Alkan, Emre Karakoc, Joseph H. Nadeau, S. Cenk Sahinalp, Kaizhong Zhang. RNA-RNA interaction prediction and antisense RNA target search. JCB

627 views • 14 slides
Exposure Prediction and Exposure Prediction and Measurement Error in Air P ll ti Pollution and

Exposure Prediction and Exposure Prediction and Measurement Error in Air P ll ti Pollution and

Exposure Prediction and Exposure Prediction and Measurement Error in Air P ll ti Pollution and Health Studies d H lth St di Lianne Sheppard Adam A. Szpiro, Sun-Young Kim p g University of Washington CMAS Special Session, October 13, 2010

506 views • 16 slides
DBAASP Special prediction as a tool for the prediction of antimicrobial potency against particular

DBAASP Special prediction as a tool for the prediction of antimicrobial potency against particular

DBAASP Special prediction as a tool for the prediction of antimicrobial potency against particular target species Boris Vishnepolsky 1, *, Maya Grigolava 1 , George Zaalishvili 2 , Margarita Karapetian 2 and Malak Pirtskhalava 1, * 1 I.Beritashvili

987 views • 23 slides
Part-II Parametric Signal Modeling and Linear Prediction Theory 3. Linear Prediction Electrical

Part-II Parametric Signal Modeling and Linear Prediction Theory 3. Linear Prediction Electrical

3 Linear Prediction Appendix: Detailed Derivations Part-II Parametric Signal Modeling and Linear Prediction Theory 3. Linear Prediction Electrical & Computer Engineering University of Maryland, College Park Acknowledgment: ENEE630 slides

392 views • 28 slides
Non parametric prediction and mapping of standing Non-parametric prediction and mapping of

Non parametric prediction and mapping of standing Non-parametric prediction and mapping of

Non parametric prediction and mapping of standing Non-parametric prediction and mapping of standing timber volume and biomass in a temperate forest Workshop IBS-Dre AGs Bayes Methodik, Rumliche Statistik, kologie und Umwelt Lbeck, Dez.

348 views • 23 slides
A story of two predictions Prediction A Uranus Prediction of additional, Orbital undiscovered

A story of two predictions Prediction A Uranus Prediction of additional, Orbital undiscovered

14.07.2016 ECT* Doctoral Training Program Timon Emken (CP 3 -Origins, University of Southern Denmark, Odense) Collaborators: Chris Kouvaris (CP 3 -Origins) A story of two predictions Prediction A Uranus Prediction of additional, Orbital

600 views • 35 slides
Improved Initialization and Prediction of Clouds in Numerical Weather Prediction Tom Aulign

Improved Initialization and Prediction of Clouds in Numerical Weather Prediction Tom Aulign

Sixth Symposium on Data Assimilation. Washington, DC. Oct. 7-11, 2013 Improved Initialization and Prediction of Clouds in Numerical Weather Prediction Tom Aulign National Center for Atmospheric Research Acknowledgments: Gael Descombes,

255 views • 14 slides
CS 104 Computer Organization and Design Branch Prediction CS104:Branch Prediction 1 Branch

CS 104 Computer Organization and Design Branch Prediction CS104:Branch Prediction 1 Branch

CS 104 Computer Organization and Design Branch Prediction CS104:Branch Prediction 1 Branch Prediction Quick Overview App App App Now that we know about SRAMs System software Mem CPU I/O CS104: Branch Prediction 2 Branch

677 views • 21 slides
Regulatory Motif Prediction in DNA Regulatory Motif Prediction in DNA Introduction: toward

Regulatory Motif Prediction in DNA Regulatory Motif Prediction in DNA Introduction: toward

Regulatory Motif Prediction in DNA Regulatory Motif Prediction in DNA Introduction: toward transcription regulatory networks Ab initio discovery of motifs by over-representation of regular expressions The weight matrix

1.19k views • 65 slides
Link prediction via matrix factorization Charles Elkan University of California, San Diego

Link prediction via matrix factorization Charles Elkan University of California, San Diego

Link prediction via matrix factorization Charles Elkan University of California, San Diego September 6, 2011 1 / 26 Outline Introduction: Three related prediction tasks 1 Link prediction in networks 2 Discussion 3 2 / 26 Link prediction

436 views • 27 slides
Bottom-up Estimation and Top-down Prediction for Multi-level Models: Solar Energy Prediction

Bottom-up Estimation and Top-down Prediction for Multi-level Models: Solar Energy Prediction

Bottom-up Estimation and Top-down Prediction for Multi-level Models: Solar Energy Prediction Combining Information from Multiple Sources Jae-Kwang Kim Department of Statistics, Iowa State University Ross-Royall Symposium: Johns Hopkins

857 views • 37 slides
Prediction of Low Pressure Subcooled Burnout Test using General Prediction Methods Hyung Min Son a

Prediction of Low Pressure Subcooled Burnout Test using General Prediction Methods Hyung Min Son a

Transactions of the Korean Nuclear Society Virtual Spring Meeting July 9-10, 2020 Prediction of Low Pressure Subcooled Burnout Test using General Prediction Methods Hyung Min Son a , Jonghark Park a a Korea Atomic Energy Research Institute,

177 views • 3 slides
Link prediction The link prediction space is vast and imbalanced : real approaches focus only in

Link prediction The link prediction space is vast and imbalanced : real approaches focus only in

Link prediction The link prediction space is vast and imbalanced : real approaches focus only in the 2-hop social neighborhood, i.e., friends-of- friends . A new source of promising candidates for link prediction: the places visited by each user.

764 views • 9 slides
Ethical challenges associated with prediction and early detection of dementia Dr Richard Milne

Ethical challenges associated with prediction and early detection of dementia Dr Richard Milne

Ethical challenges associated with prediction and early detection of dementia Dr Richard Milne The promise of prediction The problems of prediction Right to know Right not to know Support ability to plan, manage Limited predictive power

377 views • 18 slides
Branch Prediction Branch Prediction vs vs Execution Time Execution Time Prediction

Branch Prediction Branch Prediction vs vs Execution Time Execution Time Prediction

Branch Prediction Branch Prediction vs vs Execution Time Execution Time Prediction Prediction Jakob Engblom, PhD Jakob Engblom, PhD Uppsala Unive University rsity & Virtutech Inc. & Virtutech Inc. Uppsala virtutech virtu

377 views • 26 slides

More recommend