Results 1 - 10
of
165
Fast Folding and Comparison of RNA Secondary Structures (The Vienna RNA Package)
"... Computer codes for computation and comparison of RNA secondary structures, the Vienna RNA package, are presented, that are based on dynamic programming algorithms and aim at predictions of structures with minimum free energies as well as at computations of the equilibrium partition functions and bas ..."
Abstract
-
Cited by 329 (76 self)
- Add to MetaCart
Computer codes for computation and comparison of RNA secondary structures, the Vienna RNA package, are presented, that are based on dynamic programming algorithms and aim at predictions of structures with minimum free energies as well as at computations of the equilibrium partition functions and base pairing probabilities. An efficient heuristic for the inverse folding problem of RNA is introduced. In addition we present compact and efficient programs for the comparison of RNA secondary structures based on tree editing and alignment. All computer codes are written in ANSI C. They include implementations of modified algorithms on parallel computers with distributed memory. Performance analysis carried out on an Intel Hypercube shows that parallel computing becomes gradually more and more efficient the longer the sequences are.
Mfold web server for nucleic acid folding and hybridization prediction
- Nucleic Acids Res
, 2003
"... The abbreviated name,‘mfold web server’,describes a number of closely related software applications available on the World Wide Web (WWW) for the prediction of the secondary structure of single stranded nucleic acids. The objective of this web server is to provide easy access to RNA and DNA folding ..."
Abstract
-
Cited by 256 (0 self)
- Add to MetaCart
The abbreviated name,‘mfold web server’,describes a number of closely related software applications available on the World Wide Web (WWW) for the prediction of the secondary structure of single stranded nucleic acids. The objective of this web server is to provide easy access to RNA and DNA folding and hybridization software to the scientific community at large. By making use of universally available web GUIs (Graphical User Interfaces),the server circumvents the problem of portability of this software. Detailed output,in the form of structure plots with or without reliability information,single strand frequency plots and ‘energy dot plots’, are available for the folding of single sequences. A variety of ‘bulk ’ servers give less information,but in a shorter time and for up to hundreds of sequences at once. The portal for the mfold web server is
Fast and reliable prediction of noncoding RNAs
- Proc Natl Acad Sci USA
"... We report an efficient method to detect functional RNAs. The approach, which combines comparative sequence analysis and structure prediction, yields excellent results already for a small number of aligned sequences and is suitable for large scale-genomic screens. It consists of two basic components: ..."
Abstract
-
Cited by 112 (16 self)
- Add to MetaCart
We report an efficient method to detect functional RNAs. The approach, which combines comparative sequence analysis and structure prediction, yields excellent results already for a small number of aligned sequences and is suitable for large scale-genomic screens. It consists of two basic components: (1) a novel measure for RNA secondary structure conservation based on computing a consensus secondary structure, and (2) a measure for thermodynamic stability, which — in the spirit of a z-score — is normalized w.r.t. both sequence length and base composition but can be calculated without sampling from shuffled sequences. Functional RNA secondary structures can be identified in multiple sequence alignments with high sensitivity and high specificity. We demonstrate that this approach is not only much more accurate than previous methods but also significantly faster. The method is implemented in the program RNAz, which can be downloaded from
Pfold: RNA secondary structure prediction using stochastic context-free grammars
- Nucleic Acids Res
, 2003
"... RNA secondary structures are important in many biological processes and efficient structure prediction can give vital directions for experimental investigations. Many available programs for RNA secondary structure prediction only use a single sequence at a time. This may be sufficient in some applic ..."
Abstract
-
Cited by 81 (2 self)
- Add to MetaCart
RNA secondary structures are important in many biological processes and efficient structure prediction can give vital directions for experimental investigations. Many available programs for RNA secondary structure prediction only use a single sequence at a time. This may be sufficient in some applications, but often it is possible to obtain related RNA sequences with conserved secondary structure. These should be included in structural analyses to give improved results. This work presents a practical way of predicting RNA secondary structure that is especially useful when related sequences can be obtained. The method improves a previous algorithm based on an explicit evolutionary model and a probabilistic model of structures. Predictions can be done on a web server at
Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots
- Discrete Applied Mathematics
, 2000
"... structure prediction with pseudoknots ..."
RNA Folding and Combinatory Landscapes
, 1993
"... In this paper we view the folding of polynucleotide (RNA) sequences as a map that assigns to each sequence a minimum free energy pattern of base pairings, known as secondary structure. Considering only the free energy leads to an energy landscape over the sequence space. Taking into account structur ..."
Abstract
-
Cited by 61 (28 self)
- Add to MetaCart
In this paper we view the folding of polynucleotide (RNA) sequences as a map that assigns to each sequence a minimum free energy pattern of base pairings, known as secondary structure. Considering only the free energy leads to an energy landscape over the sequence space. Taking into account structure generates a less visualizable non-scalar "landscape", where a sequence space is mapped into a space of discrete "shapes". We investigate the statistical features of both types of landscapes by computing autocorrelation functions, as well as distributions of energy and structure distances, as a function of distance in sequence space. RNA folding is characterized by very short structure correlation lengths compared to the diameter of the sequence space. The correlation lengths depend strongly on the size and the pairing rules of the underlying nucleotide alphabet. Our data suggest that almost every minimum free energy structure is found within a small neighborhood of any random sequence. The...
A benchmark of multiple sequence alignment programs upon structural RNAs
- Nucleic Acids Res
, 2005
"... To date, few attempts have been made to benchmark the alignment algorithms upon nucleic acid sequences. Frequently, sophisticated PAM or BLOSUM like models are used to align proteins, yet equivalents are not considered for nucleic acids; instead, rather ad hoc models are generally favoured. Here, we ..."
Abstract
-
Cited by 58 (8 self)
- Add to MetaCart
To date, few attempts have been made to benchmark the alignment algorithms upon nucleic acid sequences. Frequently, sophisticated PAM or BLOSUM like models are used to align proteins, yet equivalents are not considered for nucleic acids; instead, rather ad hoc models are generally favoured. Here, we systematically test the performance of existing alignment algorithms on structural RNAs. This work was aimed at achieving the following goals: (i) to determine conditions where it is appropriate to apply common sequence alignment methods to the structuralRNAalignmentproblem.Thisindicates where and when researchers should consider augmenting the alignment process with auxiliary information, such as secondary structure and (ii) to determine which sequence alignment algorithms perform well under the broadest range of conditions. We find that sequence alignment alone, using the current algorithms, is generally inappropriate,50–60 % sequence identity. Second, we note that the probabilistic method ProAlign and the aging Clustal algorithms generally outperform other sequence-based algorithms, under the broadest range of applications.
Consensus Folding of Aligned Sequences as a New Measure for the Detection of Functional RNAs by Comparative Genomics
, 2004
"... Facing the ever-growing list of newly discovered classes of functional RNAs, it can be expected that further types of functional RNAs are still hidden in recently completed genomes. The computational identification of such RNA genes is, therefore, of major importance. While most known functional RNA ..."
Abstract
-
Cited by 45 (12 self)
- Add to MetaCart
Facing the ever-growing list of newly discovered classes of functional RNAs, it can be expected that further types of functional RNAs are still hidden in recently completed genomes. The computational identification of such RNA genes is, therefore, of major importance. While most known functional RNAs have characteristic secondary structures, their free energies are generally not statistically significant enough to distinguish RNA genes from the genomic background. Additional information is required. Considering the wide availability of new genomic data of closely related species, comparative studies seem to be the most promising approach. Here we show that prediction of consensus structures of aligned sequences can be a significant measure to detect functional RNAs. We report a new method how to test multiple sequence alignments for the existence of an unusually structured and conserved fold. We show for alignments of six types of well known functional RNA that an energy score consisting of free energy and a covariation term significantly improves sensitivity compared to single sequence predictions. We further test our method on a number of non coding RNAs from C. elegans/C. briggsae and seven Saccharomyces species. Most RNAs can be detected with high significance. We provide a Perl implementation which can be readily used to score single alignments and discuss how the methods described here can be extended to allow for e#cient genome-wide screens.
An Iterated loop matching approach to the prediction of RNA secondary structures with pseudoknots
, 2004
"... Motivation: Pseudoknots have generally been excluded from the prediction of RNA secondary structures due to its difficulty in modeling. Although, several dynamic programming algorithms exist for the prediction of pseudoknots using thermodynamic approaches, they are neither reliable nor efficient. On ..."
Abstract
-
Cited by 39 (2 self)
- Add to MetaCart
Motivation: Pseudoknots have generally been excluded from the prediction of RNA secondary structures due to its difficulty in modeling. Although, several dynamic programming algorithms exist for the prediction of pseudoknots using thermodynamic approaches, they are neither reliable nor efficient. On the other hand, comparative methods are more reliable, but are often done in an ad hoc manner and require expert intervention. Maximum weighted matching, an algorithm for pseudoknot prediction with comparative analysis, suffers from low-prediction accuracy in many cases.

