RNA folding kinetics using Monte Carlo and Gillespie algorithms
From MaRDI portal
(Redirected from Publication:1741906)
Abstract: RNA secondary structure folding kinetics is known to be important for the biological function of certain processes, such as the hok/sok system in E. coli. Although linear algebra provides an exact computational solution of secondary structure folding kinetics with respect to the Turner energy model for tiny (~ 20 nt) RNA sequences, the folding kinetics for larger sequences can only be approximated by binning structures into macrostates in a coarse-grained model, or by repeatedly simulating secondary structure folding with either the Monte Carlo algorithm or the Gillespie algorithm. Here we investigate the relation between the Monte Carlo algorithm and the Gillespie algorithm. We prove that asymptotically, the expected time for a K-step trajectory of the Monte Carlo algorithm is equal to <N> times that of the Gillespie algorithm, where <N> denotes the Boltzmann expected network degree. If the network is regular (i.e. every node has the same degree), then the mean first passage time (MFPT) computed by the Monte Carlo algorithm is equal to MFPT computed by the Gillespie algorithm multiplied by <N>; however, this is not true for non-regular networks. In particular, RNA secondary structure folding kinetics, as computed by the Monte Carlo algorithm, is not equal to the folding kinetics, as computed by the Gillespie algorithm, although the mean first passage times are roughly correlated. Simulation software for RNA secondary structure folding according to the Monte Carlo and Gille- spie algorithms is publicly available, as is our software to compute the expected degree of the net- work of secondary structures of a given RNA sequence { see http://bioinformatics.bc.edu/clote/ RNAexpNumNbors.
Recommendations
- An IP algorithm for RNA folding trajectories
- scientific article; zbMATH DE number 426426
- RNA folding pathways and kinetics using 2D energy landscapes
- Prediction and statistics of pseudoknots in RNA structures using exactly clustered stochastic simulations
- scientific article; zbMATH DE number 4116366
Cites work
- scientific article; zbMATH DE number 1455130 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- Combinatorics of locally optimal RNA secondary structures
- Efficient computation of RNA folding dynamics
- Equation of state calculations by fast computing machines
- Funnels in energy landscapes
- Monte Carlo sampling methods using Markov chains and their applications
- On some new sequences generalizing the Catalan and Motzkin numbers
- RNA folding pathways and kinetics using 2D energy landscapes
- RNA secondary structures and their prediction
- The Role of the Group Generalized Inverse in the Theory of Finite Markov Chains
Cited in
(7)- A continuous analogue for RNA folding
- RNAexpNumNbors
- RNA folding pathways and kinetics using 2D energy landscapes
- scientific article; zbMATH DE number 6411942 (Why is no real title available?)
- scientific article; zbMATH DE number 4116367 (Why is no real title available?)
- Loops MC: an all-atom Monte Carlo simulation program for RNAs based on inverse kinematic loop closure
- An IP algorithm for RNA folding trajectories
This page was built for publication: RNA folding kinetics using Monte Carlo and Gillespie algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1741906)
