RNA folding kinetics using Monte Carlo and Gillespie algorithms (Q1741906): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q47737296, #quickstatements; #temporary_batch_1714682640488
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4484920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics of locally optimal RNA secondary structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monte Carlo sampling methods using Markov chains and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Funnels in energy landscapes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equation of State Calculations by Fast Computing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Role of the Group Generalized Inverse in the Theory of Finite Markov Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: RNA folding pathways and kinetics using 2D energy landscapes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some new sequences generalizing the Catalan and Motzkin numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient computation of RNA folding dynamics / rank
 
Normal rank
Property / cites work
 
Property / cites work: RNA secondary structures and their prediction / rank
 
Normal rank

Latest revision as of 10:22, 15 July 2024

scientific article
Language Label Description Also known as
English
RNA folding kinetics using Monte Carlo and Gillespie algorithms
scientific article

    Statements

    RNA folding kinetics using Monte Carlo and Gillespie algorithms (English)
    0 references
    0 references
    0 references
    10 April 2018
    0 references
    RNA secondary structure
    0 references
    mean first passage time
    0 references
    refolding kinetics
    0 references
    Metropolis algorithm
    0 references
    Gillespie algorithm
    0 references
    mean recurrence time
    0 references
    expected network degree
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references