Simulating RNA folding kinetics on approximated energy landscapes

Review of machine learning methods for RNA secondary structure prediction

Secondary structure plays an important role in determining the function of noncoding RNAs. Hence, identifying RNA secondary structures is of great value to research. Computational prediction is a mainstream approach for predicting RNA secondary structure. Unfortunately, even though new methods have been proposed over the past 40 years, the performance of computational prediction methods has stagnated in the last decade. Recently, with the increasing availability of RNA structure data, new methods based on machine learning (ML) technologies, especially deep learning, have alleviated the issue. In this review, we provide a comprehensive overview of RNA secondary structure prediction methods based on ML technologies and a tabularized summary of the most important methods in this field. The current pending challenges in the field of RNA secondary structure prediction and future trends are also discussed.

Aptamer-Based Affinity Chromatography for Protein Extraction and Purification

Aptamers are oligonucleotide molecules able to recognize very specifically proteins. Among the possible applications, aptamers have been used for affinity chromatography with effective results and advantages over most advanced protein separation technologies. This chapter first discusses the context of the affinity chromatography with aptamer ligands. With the adaptation of SELEX, the chemical modifications of aptamers to comply with the covalent coupling and the separation process are then extensively presented. A focus is then made about the most important applications for protein separation with real-life examples and the comparison with immunoaffinity chromatography. In spite of well-advanced demonstrations and the extraordinary potential developments, a significant optimization work is still due to deserve large-scale applications with all necessary validations. Graphical Abstract Aptamer-protein complexes by X-ray crystallography.

Structure-Guided Protein Transition Modeling with a Probabilistic Roadmap Algorithm

Proteins are macromolecules in perpetual motion, switching between structural states to modulate their function. A detailed characterization of the precise yet complex relationship between protein structure, dynamics, and function requires elucidating transitions between functionally-relevant states. Doing so challenges both wet and dry laboratories, as protein dynamics involves disparate temporal scales. In this paper, we present a novel, sampling-based algorithm to compute transition paths. The algorithm exploits two main ideas. First, it leverages known structures to initialize its search and define a reduced conformation space for rapid sampling. This is key to address the insufficient sampling issue suffered by sampling-based algorithms. Second, the algorithm embeds samples in a nearest-neighbor graph where transition paths can be efficiently computed via queries. The algorithm adapts the probabilistic roadmap framework that is popular in robot motion planning. In addition to efficiently computing lowest-cost paths between any given structures, the algorithm allows investigating hypotheses regarding the order of experimentally-known structures in a transition event. This novel contribution is likely to open up new venues of research. Detailed analysis is presented on multiple-basin proteins of relevance to human disease. Multiscaling and the AMBER ff14SB force field are used to obtain energetically-credible paths at atomistic detail.

Effects of flanking regions on HDV cotranscriptional folding kinetics

Hepatitis delta virus (HDV) ribozyme performs the self-cleavage activity through folding to a double pseudoknot structure. The folding of functional RNA structures is often coupled with the transcription process. In this work, we developed a new approach for predicting the cotranscriptional folding kinetics of RNA secondary structures with pseudoknots. We theoretically studied the cotranscriptional folding behavior of the 99-nucleotide (nt) HDV sequence, two upstream flanking sequences, and one downstream flanking sequence. During transcription, the 99-nt HDV can effectively avoid the trap intermediates and quickly fold to the cleavage-active state. It is different from its refolding kinetics, which folds into an intermediate trap state. For all the sequences, the ribozyme regions (from 1 to 73) all fold to the same structure during transcription. However, the existence of the 30-nt upstream flanking sequence can inhibit the ribozyme region folding into the active native state through forming an alternative helix Alt1 with the segments 70-90. The longer upstream flanking sequence of 54 nt itself forms a stable hairpin structure, which sequesters the formation of the Alt1 helix and leads to rapid formation of the cleavage-active structure. Although the 55-nt downstream flanking sequence could invade the already folded active structure during transcription by forming a more stable helix with the ribozyme region, the slow transition rate could keep the structure in the cleavage-active structure to perform the activity.

Predicting Cotranscriptional Folding Kinetics For Riboswitch

On the basis of a helix-based transition rate model, we developed a new method for sampling cotranscriptional RNA conformational ensemble and the prediction of cotranscriptional folding kinetics. Applications to E. coli. SRP RNA and pbuE riboswitch indicate that the model may provide reliable predictions for the cotranscriptional folding pathways and population kinetics. For E. coli. SRP RNA, the predicted population kinetics and the folding pathway are consistent with the SHAPE profiles in the recent cotranscriptional SHAPE-seq experiments. For the pbuE riboswitch, the model predicts the transcriptional termination efficiency as a function of the force. The theoretical results show (a) a force-induced transition from the aptamer (antiterminator) to the terminator structure and (b) the different folding pathways for the riboswitch with and without the ligand (adenine). More specifically, without adenine, the aptamer structure emerges as a short-lived kinetic transient state instead of a thermodynamically stable intermediate state. Furthermore, from the predicted extension-time curves, the model identifies a series of conformational switches in the pulling process, where the predicted relative residence times for the different structures are in accordance with the experimental data. The model may provide a new tool for quantitative predictions of cotranscriptional folding kinetics, and results can offer useful insights into cotranscriptional folding-related RNA functions such as regulation of gene expression with riboswitches.

Computational approaches for alternative and transient secondary structures of ribonucleic acids

Transient and alternative structures of ribonucleic acids (RNAs) play essential roles in various regulatory processes, such as translation regulation in living cells. Because experimental analyses for RNA structures are difficult and time-consuming, computational approaches based on RNA secondary structures are promising. In this article, we review computational methods for detecting and analyzing transient/alternative secondary structures of RNAs, including static approaches based on probabilistic distributions of RNA secondary structures and dynamic approaches such as kinetic folding and folding pathway predictions.

Efficient computation of co-transcriptional RNA-ligand interaction dynamics

Riboswitches form an abundant class of cis-regulatory RNA elements that mediate gene expression by binding a small metabolite. For synthetic biology applications, they are becoming cheap and accessible systems for selectively triggering transcription or translation of downstream genes. Many riboswitches are kinetically controlled, hence knowledge of their co-transcriptional mechanisms is essential. We present here an efficient implementation for analyzing co-transcriptional RNA-ligand interaction dynamics. This approach allows for the first time to model concentration-dependent metabolite binding/unbinding kinetics. We exemplify this novel approach by means of the recently studied I-A 2^'-deoxyguanosine (2^'dG)-sensing riboswitch from Mesoplasma florum.

RNA folding kinetics using Monte Carlo and Gillespie algorithms

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 ([Formula: see text]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 [Formula: see text] times that of the Gillespie algorithm, where [Formula: see text] 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 [Formula: see text]; 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 Gillespie algorithms is publicly available, as is our software to compute the expected degree of the network of secondary structures of a given RNA sequence-see http://bioinformatics.bc.edu/clote/RNAexpNumNbors .

Predicting RNA secondary structures from sequence and probing data

RNA secondary structures have proven essential for understanding the regulatory functions performed by RNA such as microRNAs, bacterial small RNAs, or riboswitches. This success is in part due to the availability of efficient computational methods for predicting RNA secondary structures. Recent advances focus on dealing with the inherent uncertainty of prediction by considering the ensemble of possible structures rather than the single most stable one. Moreover, the advent of high-throughput structural probing has spurred the development of computational methods that incorporate such experimental data as auxiliary information.

A stochastic roadmap method to model protein structural transitions

Evidence is emerging that the role of protein structure in disease needs to be rethought. Sequence mutations in proteins are often found to affect the rate at which a protein switches between structures. Modeling structural transitions in wildtype and variant proteins is central to understanding the molecular basis of disease. This paper investigates an efficient algorithmic realization of the stochastic roadmap simulation framework to model structural transitions in wildtype and variants of proteins implicated in human disorders. Our results indicate that the algorithm is able to extract useful information on the impact of mutations on protein structure and function.

An implementation of the Gillespie algorithm for RNA kinetics with logarithmic time update

In this paper I outline a fast method called KFOLD for implementing the Gillepie algorithm to stochastically sample the folding kinetics of an RNA molecule at single base-pair resolution. In the same fashion as the KINFOLD algorithm, which also uses the Gillespie algorithm to predict folding kinetics, KFOLD stochastically chooses a new RNA secondary structure state that is accessible from the current state by a single base-pair addition/deletion following the Gillespie procedure. However, unlike KINFOLD, the KFOLD algorithm utilizes the fact that many of the base-pair addition/deletion reactions and their corresponding rates do not change between each step in the algorithm. This allows KFOLD to achieve a substantial speed-up in the time required to compute a prediction of the folding pathway and, for a fixed number of base-pair moves, performs logarithmically with sequence size. This increase in speed opens up the possibility of studying the kinetics of much longer RNA sequences at single base-pair resolution while also allowing for the RNA folding statistics of smaller RNA sequences to be computed much more quickly.

MINT: software to identify motifs and short-range interactions in trajectories of nucleic acids

Structural biology experiments and structure prediction tools have provided many high-resolution three-dimensional structures of nucleic acids. Also, molecular dynamics force field parameters have been adapted to simulating charged and flexible nucleic acid structures on microsecond time scales. Therefore, we can generate the dynamics of DNA or RNA molecules, but we still lack adequate tools for the analysis of the resulting huge amounts of data. We present MINT (Motif Identifier for Nucleic acids Trajectory) — an automatic tool for analyzing three-dimensional structures of RNA and DNA, and their full-atom molecular dynamics trajectories or other conformation sets (e.g. X-ray or nuclear magnetic resonance-derived structures). For each RNA or DNA conformation MINT determines the hydrogen bonding network resolving the base pairing patterns, identifies secondary structure motifs (helices, junctions, loops, etc.) and pseudoknots. MINT also estimates the energy of stacking and phosphate anion-base interactions. For many conformations, as in a molecular dynamics trajectory, MINT provides averages of the above structural and energetic features and their evolution. We show MINT functionality based on all-atom explicit solvent molecular dynamics trajectory of the 30S ribosomal subunit.

Fast, approximate kinetics of RNA folding

In this article, we introduce the software suite Hermes, which provides fast, novel algorithms for RNA secondary structure kinetics. Using the fast Fourier transform to efficiently compute the Boltzmann probability that a secondary structure S of a given RNA sequence has base pair distance x (resp. y) from reference structure A (resp. B), Hermes computes the exact kinetics of folding from A to B in this coarse-grained model. In particular, Hermes computes the mean first passage time from the transition probability matrix by using matrix inversion, and also computes the equilibrium time from the rate matrix by using spectral decomposition. Due to the model granularity and the speed of Hermes, it is capable of determining secondary structure refolding kinetics for large RNA sequences, beyond the range of other methods. Comparative benchmarking of Hermes with other methods indicates that Hermes provides refolding kinetics of accuracy suitable for use in the computational design of RNA, an important area of synthetic biology. Source code and documentation for Hermes are available.

RNA folding: structure prediction, folding kinetics and ion electrostatics

Beyond the "traditional" functions such as gene storage, transport and protein synthesis, recent discoveries reveal that RNAs have important "new" biological functions including the RNA silence and gene regulation of riboswitch. Such functions of noncoding RNAs are strongly coupled to the RNA structures and proper structure change, which naturally leads to the RNA folding problem including structure prediction and folding kinetics. Due to the polyanionic nature of RNAs, RNA folding structure, stability and kinetics are strongly coupled to the ion condition of solution. The main focus of this chapter is to review the recent progress in the three major aspects in RNA folding problem: structure prediction, folding kinetics and ion electrostatics. This chapter will introduce both the recent experimental and theoretical progress, while emphasize the theoretical modelling on the three aspects in RNA folding.

Memory-efficient RNA energy landscape exploration

MOTIVATION

Energy landscapes provide a valuable means for studying the folding dynamics of short RNA molecules in detail by modeling all possible structures and their transitions. Higher abstraction levels based on a macro-state decomposition of the landscape enable the study of larger systems; however, they are still restricted by huge memory requirements of exact approaches.

RESULTS

We present a highly parallelizable local enumeration scheme that enables the computation of exact macro-state transition models with highly reduced memory requirements. The approach is evaluated on RNA secondary structure landscapes using a gradient basin definition for macro-states. Furthermore, we demonstrate the need for exact transition models by comparing two barrier-based approaches, and perform a detailed investigation of gradient basins in RNA energy landscapes.

AVAILABILITY AND IMPLEMENTATION

Source code is part of the C++ Energy Landscape Library available at http://www.bioinf.uni-freiburg.de/Software/.

Basin Hopping Graph: a computational framework to characterize RNA folding landscapes

MOTIVATION

RNA folding is a complicated kinetic process. The minimum free energy structure provides only a static view of the most stable conformational state of the system. It is insufficient to give detailed insights into the dynamic behavior of RNAs. A sufficiently sophisticated analysis of the folding free energy landscape, however, can provide the relevant information.

RESULTS

We introduce the Basin Hopping Graph (BHG) as a novel coarse-grained model of folding landscapes. Each vertex of the BHG is a local minimum, which represents the corresponding basin in the landscape. Its edges connect basins when the direct transitions between them are 'energetically favorable'. Edge weights endcode the corresponding saddle heights and thus measure the difficulties of these favorable transitions. BHGs can be approximated accurately and efficiently for RNA molecules well beyond the length range accessible to enumerative algorithms.

AVAILABILITY AND IMPLEMENTATION

The algorithms described here are implemented in C++ as standalone programs. Its source code and supplemental material can be freely downloaded from http://www.tbi.univie.ac.at/bhg.html.

Analysing RNA-kinetics based on folding space abstraction

BACKGROUND

RNA molecules, especially non-coding RNAs, play vital roles in the cell and their biological functions are mostly determined by structural properties. Often, these properties are related to dynamic changes in the structure, as in the case of riboswitches, and thus the analysis of RNA folding kinetics is crucial for their study. Exact approaches to kinetic folding are computationally expensive and, thus, limited to short sequences. In a previous study, we introduced a position-specific abstraction based on helices which we termed helix index shapes (hishapes) and a hishape-based algorithm for near-optimal folding pathway computation, called HiPath. The combination of these approaches provides an abstract view of the folding space that offers information about the global features.

RESULTS

In this paper we present HiKinetics, an algorithm that can predict RNA folding kinetics for sequences up to several hundred nucleotides long. This algorithm is based on RNAHeliCes, which decomposes the folding space into abstract classes, namely hishapes, and an improved version of HiPath, namely HiPath2, which estimates plausible folding pathways that connect these classes. Furthermore, we analyse the relationship of hishapes to locally optimal structures, the results of which strengthen the use of the hishape abstraction for studying folding kinetics. Finally, we show the application of HiKinetics to the folding kinetics of two well-studied RNAs.

CONCLUSIONS

HiKinetics can calculate kinetic folding based on a novel hishape decomposition. HiKinetics, together with HiPath2 and RNAHeliCes, is available for download at http://www.cyanolab.de/software/RNAHeliCes.htm.

RNA folding pathways and kinetics using 2D energy landscapes

RNA folding pathways play an important role in various biological processes, such as (i) the hok/sok (host-killing/suppression of killing) system in E. coli to check for sufficient plasmid copy number, (ii) the conformational switch in spliced leader (SL) RNA from Leptomonas collosoma, which controls trans splicing of a portion of the '5 exon, and (iii) riboswitches--portions of the 5' untranslated region of messenger RNA that regulate genes by allostery. Since RNA folding pathways are determined by the energy landscape, we describe a novel algorithm, FFTbor2D, which computes the 2D projection of the energy landscape for a given RNA sequence. Given two metastable secondary structures A, B for a given RNA sequence, FFTbor2D computes the Boltzmann probability p(x, y) = Z(x,y)/Z that a secondary structure has base pair distance x from A and distance y from B. Using polynomial interpolationwith the fast Fourier transform,we compute p(x, y) in O(n(5)) time and O(n(2)) space, which is an improvement over an earlier method, which runs in O(n(7)) time and O(n(4)) space. FFTbor2D has potential applications in synthetic biology, where one might wish to design bistable switches having target metastable structures A, B with favorable pathway kinetics. By inverting the transition probability matrix determined from FFTbor2D output, we show that L. collosoma spliced leader RNA has larger mean first passage time from A to B on the 2D energy landscape, than 97.145% of 20,000 sequences, each having metastable structures A, B. Source code and binaries are freely available for download at http://bioinformatics.bc.edu/clotelab/FFTbor2D. The program FFTbor2D is implemented in C++, with optional OpenMP parallelization primitives.

SIMS: a hybrid method for rapid conformational analysis

Proteins are at the root of many biological functions, often performing complex tasks as the result of large changes in their structure. Describing the exact details of these conformational changes, however, remains a central challenge for computational biology due the enormous computational requirements of the problem. This has engendered the development of a rich variety of useful methods designed to answer specific questions at different levels of spatial, temporal, and energetic resolution. These methods fall largely into two classes: physically accurate, but computationally demanding methods and fast, approximate methods. We introduce here a new hybrid modeling tool, the Structured Intuitive Move Selector (sims), designed to bridge the divide between these two classes, while allowing the benefits of both to be seamlessly integrated into a single framework. This is achieved by applying a modern motion planning algorithm, borrowed from the field of robotics, in tandem with a well-established protein modeling library. sims can combine precise energy calculations with approximate or specialized conformational sampling routines to produce rapid, yet accurate, analysis of the large-scale conformational variability of protein systems. Several key advancements are shown, including the abstract use of generically defined moves (conformational sampling methods) and an expansive probabilistic conformational exploration. We present three example problems that sims is applied to and demonstrate a rapid solution for each. These include the automatic determination of “active” residues for the hinge-based system Cyanovirin-N, exploring conformational changes involving long-range coordinated motion between non-sequential residues in Ribose-Binding Protein, and the rapid discovery of a transient conformational state of Maltose-Binding Protein, previously only determined by Molecular Dynamics. For all cases we provide energetic validations using well-established energy fields, demonstrating this framework as a fast and accurate tool for the analysis of a wide range of protein flexibility problems.

Computational analysis of noncoding RNAs

Noncoding RNAs have emerged as important key players in the cell. Understanding their surprisingly diverse range of functions is challenging for experimental and computational biology. Here, we review computational methods to analyze noncoding RNAs. The topics covered include basic and advanced techniques to predict RNA structures, annotation of noncoding RNAs in genomic data, mining RNA-seq data for novel transcripts and prediction of transcript structures, computational aspects of microRNAs, and database resources.

Efficient procedures for the numerical simulation of mid-size RNA kinetics

Motivation

Methods for simulating the kinetic folding of RNAs by numerically solving the chemical master equation have been developed since the late 90's, notably the programs Kinfold and Treekin with Barriers that are available in the Vienna RNA package. Our goal is to formulate extensions to the algorithms used, starting from the Gillespie algorithm, that will allow numerical simulations of mid-size (~ 60–150 nt) RNA kinetics in some practical cases where numerous distributions of folding times are desired. These extensions can contribute to analyses and predictions of RNA folding in biologically significant problems.

Results

By describing in a particular way the reduction of numerical simulations of RNA folding kinetics into the Gillespie stochastic simulation algorithm for chemical reactions, it is possible to formulate extensions to the basic algorithm that will exploit memoization and parallelism for efficient computations. These can be used to advance forward from the small examples demonstrated to larger examples of biological interest.

Software

The implementation that is described and used for the Gillespie algorithm is freely available by contacting the authors, noting that the efficient procedures suggested may also be applicable along with Vienna's Kinfold.

Cotranscriptional folding kinetics of ribonucleic acid secondary structures

We develop a systematic helix-based computational method to predict RNA folding kinetics during transcription. In our method, the transcription is modeled as stepwise process, where each step is the transcription of a nucleotide. For each step, the kinetics algorithm predicts the population kinetics, transition pathways, folding intermediates, and the transcriptional folding products. The folding pathways, rate constants, and the conformational populations for cotranscription folding show contrastingly different features than the refolding kinetics for a fully transcribed chain. The competition between the transcription speed and rate constants for the transitions between the different nascent structures determines the RNA folding pathway and the end product of folding. For example, fast transcription favors the formation of branch-like structures than rod-like structures and chain elongation in the folding process may reduce the probability of the formation of misfolded structures. Furthermore, good theory-experiment agreements suggest that our method may provide a reliable tool for quantitative prediction for cotranscriptional RNA folding, including the kinetics for the population distribution for the whole conformational ensemble.

Approximating the set of local minima in partial RNA folding landscapes

MOTIVATION

We study a stochastic method for approximating the set of local minima in partial RNA folding landscapes associated with a bounded-distance neighbourhood of folding conformations. The conformations are limited to RNA secondary structures without pseudoknots. The method aims at exploring partial energy landscapes pL induced by folding simulations and their underlying neighbourhood relations. It combines an approximation of the number of local optima devised by Garnier and Kallel (2002) with a run-time estimation for identifying sets of local optima established by Reeves and Eremeev (2004).

RESULTS

The method is tested on nine sequences of length between 50 nt and 400 nt, which allows us to compare the results with data generated by RNAsubopt and subsequent barrier tree calculations. On the nine sequences, the method captures on average 92% of local minima with settings designed for a target of 95%. The run-time of the heuristic can be estimated by O(n(2)Dνlnν), where n is the sequence length, ν is the number of local minima in the partial landscape pL under consideration and D is the maximum number of steepest descent steps in attraction basins associated with pL.

Computing the partition function for kinetically trapped RNA secondary structures

An RNA secondary structure is locally optimal if there is no lower energy structure that can be obtained by the addition or removal of a single base pair, where energy is defined according to the widely accepted Turner nearest neighbor model. Locally optimal structures form kinetic traps, since any evolution away from a locally optimal structure must involve energetically unfavorable folding steps. Here, we present a novel, efficient algorithm to compute the partition function over all locally optimal secondary structures of a given RNA sequence. Our software, RNAlocopt runs in time and space. Additionally, RNAlocopt samples a user-specified number of structures from the Boltzmann subensemble of all locally optimal structures. We apply RNAlocopt to show that (1) the number of locally optimal structures is far fewer than the total number of structures – indeed, the number of locally optimal structures approximately equal to the square root of the number of all structures, (2) the structural diversity of this subensemble may be either similar to or quite different from the structural diversity of the entire Boltzmann ensemble, a situation that depends on the type of input RNA, (3) the (modified) maximum expected accuracy structure, computed by taking into account base pairing frequencies of locally optimal structures, is a more accurate prediction of the native structure than other current thermodynamics-based methods. The software RNAlocopt constitutes a technical breakthrough in our study of the folding landscape for RNA secondary structures. For the first time, locally optimal structures (kinetic traps in the Turner energy model) can be rapidly generated for long RNA sequences, previously impossible with methods that involved exhaustive enumeration. Use of locally optimal structure leads to state-of-the-art secondary structure prediction, as benchmarked against methods involving the computation of minimum free energy and of maximum expected accuracy. Web server and source code available at http://bioinformatics.bc.edu/clotelab/RNAlocopt/.

Computational approaches for RNA energy parameter estimation

Methods for efficient and accurate prediction of RNA structure are increasingly valuable, given the current rapid advances in understanding the diverse functions of RNA molecules in the cell. To enhance the accuracy of secondary structure predictions, we developed and refined optimization techniques for the estimation of energy parameters. We build on two previous approaches to RNA free-energy parameter estimation: (1) the Constraint Generation (CG) method, which iteratively generates constraints that enforce known structures to have energies lower than other structures for the same molecule; and (2) the Boltzmann Likelihood (BL) method, which infers a set of RNA free-energy parameters that maximize the conditional likelihood of a set of reference RNA structures. Here, we extend these approaches in two main ways: We propose (1) a max-margin extension of CG, and (2) a novel linear Gaussian Bayesian network that models feature relationships, which effectively makes use of sparse data by sharing statistical strength between parameters. We obtain significant improvements in the accuracy of RNA minimum free-energy pseudoknot-free secondary structure prediction when measured on a comprehensive set of 2518 RNA molecules with reference structures. Our parameters can be used in conjunction with software that predicts RNA secondary structures, RNA hybridization, or ensembles of structures. Our data, software, results, and parameter sets in various formats are freely available at http://www.cs.ubc.ca/labs/beta/Projects/RNA-Params.

BarMap: RNA folding on dynamic energy landscapes

Dynamical changes of RNA secondary structures play an important role in the function of many regulatory RNAs. Such kinetic effects, especially in time-variable and externally triggered systems, are usually investigated by means of extensive and expensive simulations of large sets of individual folding trajectories. Here we describe the theoretical foundations of a generic approach that not only allows the direct computation of approximate population densities but also reduces the efforts required to analyze the folding energy landscapes to a one-time preprocessing step. The basic idea is to consider the kinetics on individual landscapes and to model external triggers and environmental changes as small but discrete changes in the landscapes. A "barmap" links macrostates of temporally adjacent landscapes and defines the transfer of population densities from one "snapshot" to the next. Implemented in the BarMap software, this approach makes it feasible to study folding processes at the level of basins, saddle points, and barriers for many nonstationary scenarios, including temperature changes, cotranscriptional folding, refolding in consequence to degradation, and mechanically constrained kinetics, as in the case of the translocation of a polymer through a pore.

Molecular dynamics and quantum mechanics of RNA: conformational and chemical change we can believe in

Structure and dynamics are both critical to RNA’s vital functions in biology. Numerous techniques can elucidate the structural dynamics of RNA, but computational approaches based on experimental data arguably hold the promise of providing the most detail. In this Account, we highlight areas wherein molecular dynamics (MD) and quantum mechanical (QM) techniques are applied to RNA, particularly in relation to complementary experimental studies.

We have expanded on atomic-resolution crystal structures of RNAs in functionally relevant states by applying explicit solvent MD simulations to explore their dynamics and conformational changes on the submicrosecond time scale. MD relies on simplified atomistic, pairwise additive interaction potentials (force fields). Because of limited sampling, due to the finite accessible simulation time scale and the approximated force field, high-quality starting structures are required.

Despite their imperfection, we find that currently available force fields empower MD to provide meaningful and predictive information on RNA dynamics around a crystallographically defined energy minimum. The performance of force fields can be estimated by precise QM calculations on small model systems. Such calculations agree reasonably well with the Cornell et al. AMBER force field, particularly for stacking and hydrogen-bonding interactions. A final verification of any force field is accomplished by simulations of complex nucleic acid structures.

The performance of the Cornell et al. AMBER force field generally corresponds well with and augments experimental data, but one notable exception could be the capping loops of double-helical stems. In addition, the performance of pairwise additive force fields is obviously unsatisfactory for inclusion of divalent cations, because their interactions lead to major polarization and charge-transfer effects neglected by the force field. Neglect of polarization also limits, albeit to a lesser extent, the description accuracy of other contributions, such as interactions with monovalent ions, conformational flexibility of the anionic sugar−phosphate backbone, hydrogen bonding, and solute polarization by solvent. Still, despite limitations, MD simulations are a valid tool for analyzing the structural dynamics of existing experimental structures. Careful analysis of MD simulations can identify problematic aspects of an experimental RNA structure, unveil structural characteristics masked by experimental constraints, reveal functionally significant stochastic fluctuations, evaluate the structural role of base ionization, and predict structurally and potentially functionally important details of the solvent behavior, including the presence of tightly bound water molecules. Moreover, combining classical MD simulations with QM calculations in hybrid QM/MM approaches helps in the assessment of the plausibility of chemical mechanisms of catalytic RNAs (ribozymes).

In contrast, the reliable prediction of structure from sequence information is beyond the applicability of MD tools. The ultimate utility of computational studies in understanding RNA function thus requires that the results are neither blindly accepted nor flatly rejected, but rather considered in the context of all available experimental data, with great care given to assessing limitations through the available starting structures, force field approximations, and sampling limitations. The examples given in this Account showcase how the judicious use of basic MD simulations has already served as a powerful tool to help evaluate the role of structural dynamics in biological function of RNA.

RNA folding on the 3D triangular lattice

BACKGROUND

Difficult problems in structural bioinformatics are often studied in simple exact models to gain insights and to derive general principles. Protein folding, for example, has long been studied in the lattice model. Recently, researchers have also begun to apply the lattice model to the study of RNA folding.

RESULTS

We present a novel method for predicting RNA secondary structures with pseudoknots: first simulate the folding dynamics of the RNA sequence on the 3D triangular lattice, next extract and select a set of disjoint base pairs from the best lattice conformation found by the folding simulation. Experiments on sequences from PseudoBase show that our prediction method outperforms the HotKnot algorithm of Ren, Rastegari, Condon and Hoos, a leading method for RNA pseudoknot prediction. Our method for RNA secondary structure prediction can be adapted into an efficient reconstruction method that, given an RNA sequence and an associated secondary structure, finds a conformation of the sequence on the 3D triangular lattice that realizes the base pairs in the secondary structure. We implemented a suite of computer programs for the simulation and visualization of RNA folding on the 3D triangular lattice. These programs come with detailed documentation and are accessible from the companion website of this paper at http://www.cs.usu.edu/~mjiang/rna/DeltaIS/.

CONCLUSION

Folding simulation on the 3D triangular lattice is effective method for RNA secondary structure prediction and lattice conformation reconstruction. The visualization software for the lattice conformations of RNA structures is a valuable tool for the study of RNA folding and is a great pedagogic device.

Analysis of riboswitch structure and function by an energy landscape framework

The thiamine pyrophosphate (TPP) riboswitch employs modular domains for binding TPP to form a platform for gene expression regulation. Specifically, TPP binding triggers a conformational switch in the RNA from a transcriptionally active "on" state to an inactive "off" state that concomitantly causes the formation of a terminator hairpin and halting of transcription. Here, clustering analysis of energy landscapes at different nucleotide lengths suggests a novel computational tool for analysis of the mechanics of transcription elongation in the presence or absence of the ligand. Namely, we suggest that the riboswitch's kinetics are tightly governed by a length-dependent switch, whereby the energy landscape has two clusters available during transcription elongation and where TPP's binding shifts the preference to one form. Significantly, the biologically active and inactive structures determined experimentally matched well the structures predominant in each computational set. These clustering/structural analyses combined with modular computational design suggest design principles that exploit the above features to analyze as well as create new functions and structures of RNA systems.

A new computational approach for mechanical folding kinetics of RNA hairpins

Based on an ensemble of kinetically accessible conformations, we propose a new analytical model for RNA folding kinetics. The model gives populational kinetics, kinetic rates, transition states, and pathways from the rate matrix. Applications of the new kinetic model to mechanical folding of RNA hairpins such as trans-activation-responsive RNA reveal distinct kinetic behaviors in different force regimes, from zero force to forces much stronger than the critical force for the folding-unfolding transition. In the absence of force or a low force, folding can be initiated (nucleated) at any position by forming the first base stack and there exist many pathways for the folding process. In contrast, for a higher force, the folding/unfolding would predominantly proceed along a single zipping/unzipping pathway. Studies for different hairpin-forming sequences indicate that depending on the nucleotide sequence, a kinetic intermediate can emerge in the low force regime but disappear in high force regime, and a new kinetic intermediate, which is absent in the low and high force regimes, can emerge in the medium force range. Variations of the force lead to changes in folding cooperativity and rate-limiting steps. The predicted network of pathways for trans-activation-responsive RNA suggests two parallel dominant pathways. The rate-limiting folding steps (at f = 8 pN) are the formation of specific basepairs that are 2-4 basepairs away from the loop. At a higher force (f = 11 pN), the folding rate is controlled by the formation of the bulge loop. The predicted rates and transition states are in good agreement with the experimental data for a broad force regime.