Abstract: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 … Show more
“…We reduce these simulated trajectories to nucleotides represented by their (C3 ′ ) atoms. From there, we represent RNA structure as an undirected graph [20] using each C3 ′ as a vertex and distance dependent interactions as edges [3]. It is well known that nucleotide-based molecular interactions take place between more than one partner [21].…”
Section: Structural Representation Of Rnamentioning
confidence: 99%
“…2 The final implementation StreAM-T g is integrated in a Julia repository. 3 We created plots using the AssayToolbox library for R [39,40]. We generate all random graphs using a generator for dynamic graphs 4 derived for vertex combination.…”
Section: Evaluation Setupmentioning
confidence: 99%
“…In order to perform benchmarks with increasing k, we chose randomly nodes k ∈ [3,10] and repeated this 500 times for different numbers of snapshots (every 10,000 steps). We determined the slope (speed frames ms ) of compute time vs. k for random and MD graphs with different parameters (Table 1).…”
Section: Runtime Dependencies Of Stream On Adjacency Sizementioning
confidence: 99%
“…So far, available models and simulation tools to design and analyze functionally complex RNA based devices are very limited [2]. Although several tools are available to assess secondary as well as tertiary RNA structure [3], current capabilities to simulate dynamics are still underdeveloped [4] and rely heavily on atomistic molecular dynamics (MD) techniques [5]. RNA structure is largely modular and composed of repetitive motifs [4] that form structural elements such as hairpins and stems based on hydrogen-bonding patterns [6].…”
Background:In this work, we present a new coarse grained representation of RNA dynamics. It is based on adjacency matrices and their interactions patterns obtained from molecular dynamics simulations. RNA molecules are well-suited for this representation due to their composition which is mainly modular and assessable by the secondary structure alone. These interactions can be represented as adjacency matrices of k nucleotides. Based on those, we define transitions between states as changes in the adjacency matrices which form Markovian dynamics. The intense computational demand for deriving the transition probability matrices prompted us to develop StreAM-T g , a streambased algorithm for generating such Markov models of k-vertex adjacency matrices representing the RNA.
Results:We benchmark StreAM-T g (a) for random and RNA unit sphere dynamic graphs (b) for the robustness of our method against different parameters. Moreover, we address a riboswitch design problem by applying StreAM-T g on six long term molecular dynamics simulation of a synthetic tetracycline dependent riboswitch (500 ns) in combination with five different antibiotics.
Conclusions:The proposed algorithm performs well on large simulated as well as real world dynamic graphs. Additionally, StreAM-T g provides insights into nucleotide based RNA dynamics in comparison to conventional metrics like the root-mean square fluctuation. In the light of experimental data our results show important design opportunities for the riboswitch.
“…We reduce these simulated trajectories to nucleotides represented by their (C3 ′ ) atoms. From there, we represent RNA structure as an undirected graph [20] using each C3 ′ as a vertex and distance dependent interactions as edges [3]. It is well known that nucleotide-based molecular interactions take place between more than one partner [21].…”
Section: Structural Representation Of Rnamentioning
confidence: 99%
“…2 The final implementation StreAM-T g is integrated in a Julia repository. 3 We created plots using the AssayToolbox library for R [39,40]. We generate all random graphs using a generator for dynamic graphs 4 derived for vertex combination.…”
Section: Evaluation Setupmentioning
confidence: 99%
“…In order to perform benchmarks with increasing k, we chose randomly nodes k ∈ [3,10] and repeated this 500 times for different numbers of snapshots (every 10,000 steps). We determined the slope (speed frames ms ) of compute time vs. k for random and MD graphs with different parameters (Table 1).…”
Section: Runtime Dependencies Of Stream On Adjacency Sizementioning
confidence: 99%
“…So far, available models and simulation tools to design and analyze functionally complex RNA based devices are very limited [2]. Although several tools are available to assess secondary as well as tertiary RNA structure [3], current capabilities to simulate dynamics are still underdeveloped [4] and rely heavily on atomistic molecular dynamics (MD) techniques [5]. RNA structure is largely modular and composed of repetitive motifs [4] that form structural elements such as hairpins and stems based on hydrogen-bonding patterns [6].…”
Background:In this work, we present a new coarse grained representation of RNA dynamics. It is based on adjacency matrices and their interactions patterns obtained from molecular dynamics simulations. RNA molecules are well-suited for this representation due to their composition which is mainly modular and assessable by the secondary structure alone. These interactions can be represented as adjacency matrices of k nucleotides. Based on those, we define transitions between states as changes in the adjacency matrices which form Markovian dynamics. The intense computational demand for deriving the transition probability matrices prompted us to develop StreAM-T g , a streambased algorithm for generating such Markov models of k-vertex adjacency matrices representing the RNA.
Results:We benchmark StreAM-T g (a) for random and RNA unit sphere dynamic graphs (b) for the robustness of our method against different parameters. Moreover, we address a riboswitch design problem by applying StreAM-T g on six long term molecular dynamics simulation of a synthetic tetracycline dependent riboswitch (500 ns) in combination with five different antibiotics.
Conclusions:The proposed algorithm performs well on large simulated as well as real world dynamic graphs. Additionally, StreAM-T g provides insights into nucleotide based RNA dynamics in comparison to conventional metrics like the root-mean square fluctuation. In the light of experimental data our results show important design opportunities for the riboswitch.
“…Recently, massively feature-rich models empowered by parameter estimation algorithms have been proposed. Despite significant progress in the last three decades, made possible by the work of Turner and others [20] on measuring RNA thermodynamic energy parameters and the work of several groups on novel algorithms [21,22,23,24,25,26,27,28] and machine learning approaches [29,30,31], the RNA structure prediction accuracy has not reached a satisfactory level yet [32].…”
We consider the problem of exact learning of parameters of a linear RNA energy model from secondary structure data. A necessary and sufficient condition for learnability of parameters is derived, which is based on computing the convex hull of union of translated Newton polytopes of input sequences [1]. The set of learned energy parameters is characterized as the convex cone generated by the normal vectors to those facets of the resulting polytope that are incident to the origin. In practice, the sufficient condition may not be satisfied by the entire training data set; hence, computing a maximal subset of training data for which the sufficient condition is satisfied is often desired. We show that problem is NP-hard in general for an arbitrary dimensional feature space. Using a randomized greedy algorithm, we select a subset of RNA STRAND v2.0 database that satisfies the sufficient condition for separate A-U, C-G, G-U base pair counting model. The set of learned energy parameters includes experimentally measured energies of A-U, C-G, and G-U pairs; hence, our parameter set is in agreement with the Turner parameters.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.