Efficient computation of RNA folding dynamics
From MaRDI portal
Recommendations
Cited in
(25)- Sparse RNA folding: time and space efficient algorithms
- A stopping criterion for logarithmic simulated annealing
- Funnels in energy landscapes
- Theory and simulations for RNA folding in mixtures of monovalent and divalent cations
- A continuous analogue for RNA folding
- Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing
- Arrhenius lifetimes of RNA structures from free energy landscapes
- Dynamic extended folding: modeling the RNA secondary structures during co-transcriptional folding
- An action principle for biopolymer folding in vitro: A new perspective on the design of expeditiously-folded RNA molecules
- Stochastic local search for the FEATURE SET problem, with applications to microarray data
- Combinatorial vector fields and the valley structure of fitness landscapes
- RNA folding pathways and kinetics using 2D energy landscapes
- Evolutionary accessibility of random and structured fitness landscapes
- On a barrier height problem for RNA branching
- scientific article; zbMATH DE number 6411942 (Why is no real title available?)
- A motion planning approach to studying molecular motions
- Visualization of barrier tree sequences revisited
- scientific article; zbMATH DE number 4116367 (Why is no real title available?)
- Sparse RNA Folding: Time and Space Efficient Algorithms
- DNA Computing
- On low energy barrier folding pathways for nucleic acid sequences
- Rugged and elementary landscapes
- Energy landscapes of spin glasses on triangular Archimedean lattices
- RNA folding kinetics using Monte Carlo and Gillespie algorithms
- An IP algorithm for RNA folding trajectories
This page was built for publication: Efficient computation of RNA folding dynamics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4812461)
