A dynamic model for RNA decay by the archaeal exosome: Parameter identification by MCMC Theresa Niederberger Computational Biology - Gene Center Munich.

Slides:



Advertisements
Similar presentations
A Factor Graph Model for Minimal Gene Set Enrichment Analysis Diana Uskat Computational Biology - Gene Center Munich.
Advertisements

Hidden Markov Model in Biological Sequence Analysis – Part 2
Hidden Markov Models (1)  Brief review of discrete time finite Markov Chain  Hidden Markov Model  Examples of HMM in Bioinformatics  Estimations Basic.
Bayesian Estimation in MARK
Inspiral Parameter Estimation via Markov Chain Monte Carlo (MCMC) Methods Nelson Christensen Carleton College LIGO-G Z.
Ch 11. Sampling Models Pattern Recognition and Machine Learning, C. M. Bishop, Summarized by I.-H. Lee Biointelligence Laboratory, Seoul National.
Gibbs Sampling Qianji Zheng Oct. 5th, 2010.
Markov-Chain Monte Carlo
Computer Vision Lab. SNU Young Ki Baik An Introduction to MCMC for Machine Learning (Markov Chain Monte Carlo)
Markov Chains 1.
Introduction to Sampling based inference and MCMC Ata Kaban School of Computer Science The University of Birmingham.
CHAPTER 16 MARKOV CHAIN MONTE CARLO
Bayesian Reasoning: Markov Chain Monte Carlo
Bayesian statistics – MCMC techniques
Suggested readings Historical notes Markov chains MCMC details
BAYESIAN INFERENCE Sampling techniques
CS774. Markov Random Field : Theory and Application Lecture 16 Kyomin Jung KAIST Nov
1 Vertically Integrated Seismic Analysis Stuart Russell Computer Science Division, UC Berkeley Nimar Arora, Erik Sudderth, Nick Hay.
Gibbs sampling for motif finding in biological sequences Christopher Sheldahl.
CENTER FOR BIOLOGICAL SEQUENCE ANALYSIS Bayesian Inference Anders Gorm Pedersen Molecular Evolution Group Center for Biological Sequence Analysis Technical.
Computational statistics 2009 Random walk. Computational statistics 2009 Random walk with absorbing barrier.
Machine Learning CUNY Graduate Center Lecture 7b: Sampling.
Course overview Tuesday lecture –Those not presenting turn in short review of a paper using the method being discussed Thursday computer lab –Turn in short.
Yongjin Park, Stanley Shackney, and Russell Schwartz Accepted Computational Biology and Bioinformatics.
Today Introduction to MCMC Particle filters and MCMC
CENTER FOR BIOLOGICAL SEQUENCE ANALYSIS Bayesian Inference Anders Gorm Pedersen Molecular Evolution Group Center for Biological Sequence Analysis Technical.
Monte Carlo methods for estimating population genetic parameters Rasmus Nielsen University of Copenhagen.
Using ranking and DCE data to value health states on the QALY scale using conventional and Bayesian methods Theresa Cain.
Bayes Factor Based on Han and Carlin (2001, JASA).
Phylogeny Estimation: Traditional and Bayesian Approaches Molecular Evolution, 2003
Introduction to MCMC and BUGS. Computational problems More parameters -> even more parameter combinations Exact computation and grid approximation become.
Priors, Normal Models, Computing Posteriors
Machine Learning Lecture 23: Statistical Estimation with Sampling Iain Murray’s MLSS lecture on videolectures.net:
1 Gil McVean Tuesday 24 th February 2009 Markov Chain Monte Carlo.
ABC The method: practical overview. 1. Applications of ABC in population genetics 2. Motivation for the application of ABC 3. ABC approach 1. Characteristics.
An Efficient Sequential Design for Sensitivity Experiments Yubin Tian School of Science, Beijing Institute of Technology.
Suppressing Random Walks in Markov Chain Monte Carlo Using Ordered Overrelaxation Radford M. Neal 발표자 : 장 정 호.
Bayes’ Nets: Sampling [These slides were created by Dan Klein and Pieter Abbeel for CS188 Intro to AI at UC Berkeley. All CS188 materials are available.
Application of the MCMC Method for the Calibration of DSMC Parameters James S. Strand and David B. Goldstein The University of Texas at Austin Sponsored.
Domain Analysis of the Chloroplast Polynucleotide Phosphorylase Reveals Discrete Functions in RNA Degradation, Polyadenylation, and Sequence Homology with.
MCMC reconstruction of the 2 HE cascade events Dmitry Chirkin, UW Madison.
Markov Chain Monte Carlo for LDA C. Andrieu, N. D. Freitas, and A. Doucet, An Introduction to MCMC for Machine Learning, R. M. Neal, Probabilistic.
Lecture #9: Introduction to Markov Chain Monte Carlo, part 3
Reducing MCMC Computational Cost With a Two Layered Bayesian Approach
Construction of Substitution matrices
CS774. Markov Random Field : Theory and Application Lecture 15 Kyomin Jung KAIST Oct
1 Chapter 8: Model Inference and Averaging Presented by Hui Fang.
The Unscented Particle Filter 2000/09/29 이 시은. Introduction Filtering –estimate the states(parameters or hidden variable) as a set of observations becomes.
04/21/2005 CS673 1 Being Bayesian About Network Structure A Bayesian Approach to Structure Discovery in Bayesian Networks Nir Friedman and Daphne Koller.
CS Statistical Machine learning Lecture 25 Yuan (Alan) Qi Purdue CS Nov
Bayesian Modelling Harry R. Erwin, PhD School of Computing and Technology University of Sunderland.
The State of Microarrays The Scientist: 2003 By: Hien Dang.
Introduction: Metropolis-Hasting Sampler Purpose--To draw samples from a probability distribution There are three steps 1Propose a move from x to y 2Accept.
Kevin Stevenson AST 4762/5765. What is MCMC?  Random sampling algorithm  Estimates model parameters and their uncertainty  Only samples regions of.
HW7: Evolutionarily conserved segments ENCODE region 009 (beta-globin locus) Multiple alignment of human, dog, and mouse 2 states: neutral (fast-evolving),
SIR method continued. SIR: sample-importance resampling Find maximum likelihood (best likelihood × prior), Y Randomly sample pairs of r and N 1973 For.
How many iterations in the Gibbs sampler? Adrian E. Raftery and Steven Lewis (September, 1991) Duke University Machine Learning Group Presented by Iulian.
Hierarchical Models. Conceptual: What are we talking about? – What makes a statistical model hierarchical? – How does that fit into population analysis?
Generalization Performance of Exchange Monte Carlo Method for Normal Mixture Models Kenji Nagata, Sumio Watanabe Tokyo Institute of Technology.
Markov Chain Monte Carlo in R
Reducing Photometric Redshift Uncertainties Through Galaxy Clustering
Optimization of Monte Carlo Integration
Advanced Statistical Computing Fall 2016
A Very Basic Gibbs Sampler for Motif Detection
ERGM conditional form Much easier to calculate delta (change statistics)
Bayesian inference Presented by Amir Hadadi
Markov chain monte carlo
Katharina Büttner, Katja Wenig, Karl-Peter Hopfner  Molecular Cell 
Robust Full Bayesian Learning for Neural Networks
Structural Basis of 3′ End RNA Recognition and Exoribonucleolytic Cleavage by an Exosome RNase PH Core  Esben Lorentzen, Elena Conti  Molecular Cell 
Presentation transcript:

A dynamic model for RNA decay by the archaeal exosome: Parameter identification by MCMC Theresa Niederberger Computational Biology - Gene Center Munich

Theresa Niederberger - Gene Center Munich2 The archaeal exosome: Structure 3’-5’ exoribonuclease Highly conserved: –Eucaryotes, archaea: Exosome –Procaryotes: PNPase Side view Top view cap structure hexameric ring Hartung, Hopfner; Biochem Soc Trans Lorentzen, Conti; Nat Struct. Mol. Biol / Mol. Cell 2005

Theresa Niederberger - Gene Center Munich3 The archaeal exosome: function Lorentzen, Conti, EMBO reports‘07 Processive decay: RNA in the processing chamber is cleaved base-per-base

Theresa Niederberger - Gene Center Munich4 RNA Decay by the archaeal exosome Problem: The full model has108 parameters! Solution: Polymerization can be neglected Association, cleavage, dissociation are related  Flexible k a i, global k c, fixed k d Only 28 parameters left 30-mer 29-mer 3-mer 28-mer (30 timepoints between 0 min and 25 min) Polymerization of RNA i Cleavage of RNA i Association of RNA i and the cleavage site Dissociation of RNA i from the cleavage site

Theresa Niederberger - Gene Center Munich5 A brief reminder on MCMC A Markov Chain Monte Carlo Sampling method (Metropolis-Hastings algorithm): Ingredients: A likelihood function P(D| θ) (i.e., an error model) A prior distribution on the parameters π (θ) A proposal function (transition kernel) q(θ→θ´) rejection step proposal step Construct a sequence of samples: S1. Generate a candidate sample θ´ from q(θ→θ´) S2. Calculate S3. Accept θ´ with probability r(θ→ θ´) (add θ´ to the sequence), otherwise stay at θ (add θ to the sequence another time) Smoothness prior

Markov Chain Monte Carlo Theresa Niederberger - Gene Center Munich6 Andrieu, Jordan, Machine Learning 2003 „Good“ Markov Chain, fast convergence: Sample is representative of the posterior distribution „Bad“ Markov Chains, slow convergence: Sample is not (yet) representative of the posterior distribution

Parameter Identifiability Theresa Niederberger - Gene Center Munich7 Catalytic efficiency

Robustness w.r.t. initial parameters Theresa Niederberger - Gene Center Munich8 Traceplots for the processivity for RNA of length 4 (in the Rrp4 exosome) Initial development

Goodness of fit Theresa Niederberger - Gene Center Munich9 The model even acts as noise filter!

Results Theresa Niederberger - Gene Center Munich10 There is clear evidence for a difference in the processing of long and short RNAs between the two mutants Suprising, as no simultaneous interactions with cap structure and cleavage site can occur. Possible explanation: Rrp4 holds the hexamer ring stronger together than Csl4. Additional binding site in Rrp4 log(catalytic efficiency)

Results Theresa Niederberger - Gene Center Munich11 Short RNA is not fixed by the binding site any more

Theresa Niederberger - Gene Center Munich12 Acknowledgments Gene Center Munich: Achim Tresch Karl-Peter Hopfner, Sophia Hartung The results of this work will appear as a featured article in Nucleic Acids Research.

Exosome variants Theresa Niederberger - Gene Center Munich13 Csl4 Exosome Wild type with Csl4 cap Rrp4 Exosome Wild type with Rrp44 cap Capless Exosome Wild type without cap Csl4 Exosome R65E Csl4 protein with R65E mutation in Rrp41 Csl4 Exosome Y70A Csl4 protein with Y70A mutation in Rrp42 Interface mutant Exosome that does not form a hexamer ring Crosslink mutant Exosome with hexamer ring fixed by a crosslinker

Mixing - Autocorrelation Theresa Niederberger - Gene Center Munich14

Catalytic efficiency Based on Michaelis-Menton:  Catalytic Efficiency: Theresa Niederberger - Gene Center Munich15

Smoothness prior Theresa Niederberger - Gene Center Munich16

Simulation - Results Theresa Niederberger - Gene Center Munich17 Relative squared error: