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.

The Vienna RNA secondary structure server provides a web interface to the most frequently used functions of the Vienna RNA software package for the analysis of RNA secondary structures. It currently o#ers prediction of secondary structure from a single sequence, prediction of the consensus secondary structure for a set of aligned sequences, and the design of sequences that will fold into a predefined structure.

Abstract not found

Motivation: Many computerized methods for RNA secondary structure prediction have been developed. Few of these methods, however, employ an evolutionary model, thus relevant information is often left out from the structure determination. This paper introduces a method which incorporates evolutionary history into RNA secondary structure prediction. The method reported here is based on stochastic context-free grammars (SCFGs) to give a prior probability distribution of structures.

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

Random graph theory is used to model relationships between sequences and secondary structures of RNA molecules. Sequences folding into identical structures form neutral networks which percolate sequence space if the fraction of neutral nearest neighbors exceeds a threshold value. The networks of any two different structures almost touch each other, and sequences folding into almost all "common" structures can be found in a small ball of an arbitrary location in sequence space. The results from random graph theory are compared with data obtained by folding large samples of RNA sequences. Differences are explained in terms of RNA molecular structures. 1.

Global relations between RNA sequences and secondary structues are understood as mappings from sequence space into shape space. These mappings are investigated by exhaustive folding of all GC and AU sequences with chain lengths up to 30. The technique od tries is used for economic data storage and fast retrieval of information. The computed structural data are evaluated through exhaustive enumeration and used as an exact reference for testing analytical results derived from mathematical models and sampling based of statistical methods. Several new concepts of RNA sequence to secondary structure mappings are investigated, among them the structure of neutral networks (being sets of sequences folding into the same structure), percolation of sequence space by neutral networks, and the principle of shape space covering . The data of exhaustive enumeration are compared to the analytical results of a random graph model that reveals the generic properties of sequence to structure mappings based on some base pairing logic. The differences between the numerical and the analytical results are interpreted in terms of specific biophysical properties of RNA molecules.

RNA folding from sequences into secondary structures is a simple yet powerful, biophysically grounded model of a genotype-phenotype map in which concepts like plasticity, evolvability, epistasis, and modularity can not only be precisely defined and statistically measured but also reveal simultaneous and profoundly non-independent effects of natural selection. Molecular plasticity is viewed here as the capacity of an RNA sequence to assume a variety of energetically favorable shapes by equilibrating among them at constant temperature. Through simulations based on experimental designs, we study the dynamics of a population of RNA molecules that evolve toward a predefined target shape in a constant environment. Each shape in the plastic repertoire of a sequence contributes to the overall fitness of the sequence in proportion to the time the sequence spends in that shape. Plasticity is costly, since the more shapes a sequence can assume, the less time it spends in any one of the...

MicroRNAs (miRNAs) are an abundant class of tiny RNAs thought to regulate the expression of protein-coding genes in plants and animals. In the present study, we describe a computational procedure to identify miRNA genes conserved in more than one genome. Applying this program, known as MiRscan, together with molecular identification and validation methods, we have identified most of the miRNA genes in the nematode Caenorhabditis elegans. The total number of validated miRNA genes stands at 88, with no more than 35 genes remaining to be detected or validated. These 88 miRNA genes represent 48 gene families; 46 of these families (comprising 86 of the 88 genes) are conservedin Caenorhabditis briggsae, and22 families are conservedin humans. More than a thirdof the worm miRNAs, including newly identified members of the lin-4 and let-7 gene families, are differentially expressed during larval development, suggesting a role for these miRNAs in mediating larval developmental transitions. Most are present at very high steady-state levels—more than 1000 molecules per cell, with some exceeding 50,000 molecules per cell. Our census of the worm miRNAs andtheir expression patterns helps define this class of noncoding RNAs, lays the groundwork for functional studies, and provides the tools for more comprehensive analyses of miRNA genes in other species. [Keywords: miRNA; noncoding RNA; computational gene identification; Dicer] Supplemental material is available at

We propose a new method for detecting conserved RNA secondary structures in a family of related RNA sequences. Our method is based on a combination of thermodynamic structure prediction and phylogenetic comparison. In contrast to purely phylogenetic methods, our algorithm can be used for small data sets of about 10 sequences, efficiently exploiting the information contained in the sequence variability. The procedure constructs a prediction only for those parts of sequences that are consistent with a single conserved structure. Our implementation produces reasonable consensus structures without user interference. As an example we have analyzed complete HIV-1 and Hepatitis C virus genomes as well as the small segment of Hanta virus. Our method confirms the known structures in HIV-I and predicts previously unknown conserved RNA secondary structures in HCV.