Browse
Submit Data
Databases
API
Help

Dataset Information

20 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

A folding algorithm for extended RNA secondary structures.

ABSTRACT: MOTIVATION: RNA secondary structure contains many non-canonical base pairs of different pair families. Successful prediction of these structural features leads to improved secondary structures with applications in tertiary structure prediction and simultaneous folding and alignment. RESULTS: We present a theoretical model capturing both RNA pair families and extended secondary structure motifs with shared nucleotides using 2-diagrams. We accompany this model with a number of programs for parameter optimization and structure prediction. AVAILABILITY: All sources (optimization routines, RNA folding, RNA evaluation, extended secondary structure visualization) are published under the GPLv3 and available at www.tbi.univie.ac.at/software/rnawolf/.

SUBMITTER: Honer zu Siederdissen C

PROVIDER: S-EPMC3117358 | biostudies-literature | 2011 Jul

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

A folding algorithm for extended RNA secondary structures.

Höner zu Siederdissen Christian C Bernhart Stephan H SH Stadler Peter F PF Hofacker Ivo L IL

Bioinformatics (Oxford, England) 20110701 13

<h4>Motivation</h4>RNA secondary structure contains many non-canonical base pairs of different pair families. Successful prediction of these structural features leads to improved secondary structures with applications in tertiary structure prediction and simultaneous folding and alignment.<h4>Results</h4>We present a theoretical model capturing both RNA pair families and extended secondary structure motifs with shared nucleotides using 2-diagrams. We accompany this model with a number of program ...[more]

PMID: 21685061

Similar Datasets

TT2NE: a novel algorithm to predict RNA secondary structures with pseudoknots.

Project description:We present TT2NE, a new algorithm to predict RNA secondary structures with pseudoknots. The method is based on a classification of RNA structures according to their topological genus. TT2NE is guaranteed to find the minimum free energy structure regardless of pseudoknot topology. This unique proficiency is obtained at the expense of the maximum length of sequences that can be treated, but comparison with state-of-the-art algorithms shows that TT2NE significantly improves the quality of predictions. Analysis of TT2NE's incorrect predictions sheds light on the need to study how sterical constraints limit the range of pseudoknotted structures that can be formed from a given sequence. An implementation of TT2NE on a public server can be found at http://ipht.cea.fr/rna/tt2ne.php.

| S-EPMC3152363 | biostudies-literature

Combinatorial permutation based algorithm for representation of closed RNA secondary structures.

Project description:A permutation-based algorithm is introduced for the representation of closed RNA secondary structures. It is an efficient 'loopless' algorithm, which generates the permutations on base-pairs of 'k-noncrossing' setting partitions. The proposed algorithm reduces the computational complexity of known similar techniques in O(n), using minimal change ordering and transposing of not adjacent elements.

| S-EPMC3174042 | biostudies-literature

An extended dual graph library and partitioning algorithm applicable to pseudoknotted RNA structures.

Project description:Exploring novel RNA topologies is imperative for understanding RNA structure and pursuing its design. Our RNA-As-Graphs (RAG) approach exploits graph theory tools and uses coarse-grained tree and dual graphs to represent RNA helices and loops by vertices and edges. Only dual graphs represent pseudoknotted RNAs fully. Here we develop a dual graph enumeration algorithm to generate an expanded library of dual graph topologies for 2-9 vertices, and extend our dual graph partitioning algorithm to identify all possible RNA subgraphs. Our enumeration algorithm connects smaller-vertex graphs, using all possible edge combinations, to build larger-vertex graphs and retain all non-isomorphic graph topologies, thereby more than doubling the size of our prior library to a total of 110,667 dual graph topologies. We apply our dual graph partitioning algorithm, which keeps pseudoknots and junctions intact, to all existing RNA structures to identify all possible substructures up to 9 vertices. In addition, our expanded dual graph library assigns graph topologies to all RNA graphs and subgraphs, rectifying prior inconsistencies. We update our RAG-3Dual database of RNA atomic fragments with all newly identified substructures and their graph IDs, increasing its size by more than 50 times. The enlarged dual graph library and RAG-3Dual database provide a comprehensive repertoire of graph topologies and atomic fragments to study yet undiscovered RNA molecules and design RNA sequences with novel topologies, including a variety of pseudoknotted RNAs.

| S-EPMC6612455 | biostudies-literature

McGenus: a Monte Carlo algorithm to predict RNA secondary structures with pseudoknots.

Project description:We present McGenus, an algorithm to predict RNA secondary structures with pseudoknots. The method is based on a classification of RNA structures according to their topological genus. McGenus can treat sequences of up to 1000 bases and performs an advanced stochastic search of their minimum free energy structure allowing for non-trivial pseudoknot topologies. Specifically, McGenus uses a Monte Carlo algorithm with replica exchange for minimizing a general scoring function which includes not only free energy contributions for pair stacking, loop penalties, etc. but also a phenomenological penalty for the genus of the pairing graph. The good performance of the stochastic search strategy was successfully validated against TT2NE which uses the same free energy parametrization and performs exhaustive or partially exhaustive structure search, albeit for much shorter sequences (up to 200 bases). Next, the method was applied to other RNA sets, including an extensive tmRNA database, yielding results that are competitive with existing algorithms. Finally, it is shown that McGenus highlights possible limitations in the free energy scoring function. The algorithm is available as a web server at http://ipht.cea.fr/rna/mcgenus.php.

| S-EPMC3561945 | biostudies-literature

Multilign: an algorithm to predict secondary structures conserved in multiple RNA sequences.

Project description:MotivationWith recent advances in sequencing, structural and functional studies of RNA lag behind the discovery of sequences. Computational analysis of RNA is increasingly important to reveal structure-function relationships with low cost and speed. The purpose of this study is to use multiple homologous sequences to infer a conserved RNA structure.ResultsA new algorithm, called Multilign, is presented to find the lowest free energy RNA secondary structure common to multiple sequences. Multilign is based on Dynalign, which is a program that simultaneously aligns and folds two sequences to find the lowest free energy conserved structure. For Multilign, Dynalign is used to progressively construct a conserved structure from multiple pairwise calculations, with one sequence used in all pairwise calculations. A base pair is predicted only if it is contained in the set of low free energy structures predicted by all Dynalign calculations. In this way, Multilign improves prediction accuracy by keeping the genuine base pairs and excluding competing false base pairs. Multilign has computational complexity that scales linearly in the number of sequences. Multilign was tested on extensive datasets of sequences with known structure and its prediction accuracy is among the best of available algorithms. Multilign can run on long sequences (> 1500 nt) and an arbitrarily large number of sequences.AvailabilityThe algorithm is implemented in ANSI C++ and can be downloaded as part of the RNAstructure package at: http://rna.urmc.rochester.edu.

| S-EPMC3042186 | biostudies-literature

An Adaptive Defect Weighted Sampling Algorithm to Design Pseudoknotted RNA Secondary Structures.

Project description:Computational design of RNA sequences that fold into targeted secondary structures has many applications in biomedicine, nanotechnology and synthetic biology. An RNA molecule is made of different types of secondary structure elements and an important RNA element named pseudoknot plays a key role in stabilizing the functional form of the molecule. However, due to the computational complexities associated with characterizing pseudoknotted RNA structures, most of the existing RNA sequence designer algorithms generally ignore this important structural element and therefore limit their applications. In this paper we present a new algorithm to design RNA sequences for pseudoknotted secondary structures. We use NUPACK as the folding algorithm to compute the equilibrium characteristics of the pseudoknotted RNAs, and describe a new adaptive defect weighted sampling algorithm named Enzymer to design low ensemble defect RNA sequences for targeted secondary structures including pseudoknots. We used a biological data set of 201 pseudoknotted structures from the Pseudobase library to benchmark the performance of our algorithm. We compared the quality characteristics of the RNA sequences we designed by Enzymer with the results obtained from the state of the art MODENA and antaRNA. Our results show our method succeeds more frequently than MODENA and antaRNA do, and generates sequences that have lower ensemble defect, lower probability defect and higher thermostability. Finally by using Enzymer and by constraining the design to a naturally occurring and highly conserved Hammerhead motif, we designed 8 sequences for a pseudoknotted cis-acting Hammerhead ribozyme. Enzymer is available for download at https://bitbucket.org/casraz/enzymer.

| S-EPMC4956659 | biostudies-literature

Folding path of P5abc RNA involves direct coupling of secondary and tertiary structures.

Project description:Folding mechanisms in which secondary structures are stabilized through the formation of tertiary interactions are well documented in protein folding but challenge the folding hierarchy normally assumed for RNA. However, it is increasingly clear that RNA could fold by a similar mechanism. P5abc, a small independently folding tertiary domain of the Tetrahymena thermophila group I ribozyme, is known to fold by a secondary structure rearrangement involving helix P5c. However, the extent of this rearrangement and the precise stage of folding that triggers it are unknown. We use experiments and simulations to show that the P5c helix switches to the native secondary structure late in the folding pathway and is directly coupled to the formation of tertiary interactions in the A-rich bulge. P5c mutations show that the switch in P5c is not rate-determining and suggest that non-native interactions in P5c aid folding rather than impede it. Our study illustrates that despite significant differences in the building blocks of proteins and RNA, there may be common ways in which they self-assemble.

| S-EPMC3439887 | biostudies-other

Exact calculation of loop formation probability identifies folding motifs in RNA secondary structures.

Project description:RNA secondary structure prediction is widely used to analyze RNA sequences. In an RNA partition function calculation, free energy nearest neighbor parameters are used in a dynamic programming algorithm to estimate statistical properties of the secondary structure ensemble. Previously, partition functions have largely been used to estimate the probability that a given pair of nucleotides form a base pair, the conditional stacking probability, the accessibility to binding of a continuous stretch of nucleotides, or a representative sample of RNA structures. Here it is demonstrated that an RNA partition function can also be used to calculate the exact probability of formation of hairpin loops, internal loops, bulge loops, or multibranch loops at a given position. This calculation can also be used to estimate the probability of formation of specific helices. Benchmarking on a set of RNA sequences with known secondary structures indicated that loops that were calculated to be more probable were more likely to be present in the known structure than less probable loops. Furthermore, highly probable loops are more likely to be in the known structure than the set of loops predicted in the lowest free energy structures.

| S-EPMC5113201 | biostudies-literature

Saccharomyces SRP RNA secondary structures: a conserved S-domain and extended Alu-domain.

Project description:The contribution made by the RNA component of signal recognition particle (SRP) to its function in protein targeting is poorly understood. We have generated a complete secondary structure for Saccharomyces cerevisiae SRP RNA, scR1. The structure conforms to that of other eukaryotic SRP RNAs. It is rod-shaped with, at opposite ends, binding sites for proteins required for the SRP functions of signal sequence recognition (S-domain) and translational elongation arrest (Alu-domain). Micrococcal nuclease digestion of purified S. cerevisiae SRP separated the S-domain of the RNA from the Alu-domain as a discrete fragment. The Alu-domain resolved into several stable fragments indicating a compact structure. Comparison of scR1 with SRP RNAs of five yeast species related to S. cerevisiae revealed the S-domain to be the most conserved region of the RNA. Extending data from nuclease digestion with phylogenetic comparison, we built the secondary structure model for scR1. The Alu-domain contains large extensions, including a sequence with hallmarks of an expansion segment. Evolutionarily conserved bases are placed in the Alu- and S-domains as in other SRP RNAs, the exception being an unusual GU(4)A loop closing the helix onto which the signal sequence binding Srp54p assembles (domain IV). Surprisingly, several mutations within the predicted Srp54p binding site failed to disrupt SRP function in vivo. However, the strength of the Srp54p-scR1 and, to a lesser extent, Sec65p-scR1 interaction was decreased in these mutant particles. The availability of a secondary structure for scR1 will facilitate interpretation of data from genetic analysis of the RNA.

| S-EPMC1370520 | biostudies-literature

An Algorithm for Template-Based Prediction of Secondary Structures of Individual RNA Sequences.

Project description:While understanding the structure of RNA molecules is vital for deciphering their functions, determining RNA structures experimentally is exceptionally hard. At the same time, extant approaches to computational RNA structure prediction have limited applicability and reliability. In this paper we provide a method to solve a simpler yet still biologically relevant problem: prediction of secondary RNA structure using structure of different molecules as a template. Our method identifies conserved and unconserved subsequences within an RNA molecule. For conserved subsequences, the template structure is directly transferred into the generated structure and combined with de-novo predicted structure for the unconserved subsequences with low evolutionary conservation. The method also determines, when the generated structure is unreliable. The method is validated using experimentally identified structures. The accuracy of the method exceeds that of classical prediction algorithms and constrained prediction methods. This is demonstrated by comparison using large number of heterogeneous RNAs. The presented method is fast and robust, and useful for various applications requiring knowledge of secondary structures of individual RNA sequences.

| S-EPMC5641303 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data