Complete suboptimal folding of RNA and the stability of secondary structures

An algorithm is presented for generating rigorously all suboptimal secondary structures between the minimum free energy and an arbitrary upper limit. The algorithm is particularly fast in the vicinity of the minimum free energy. This enables the efficient approximation of statistical quantities, such as the partition function or measures for structural diversity. The density of states at low energies and its associated structures are crucial in assessing from a thermodynamic point of view how well-defined the ground state is. We demonstrate this by exploring the role of base modification in tRNA secondary structures, both at the level of individual sequences from Escherichia coli and by comparing artificially generated ensembles of modified and unmodified sequences with the same tRNA structure. The two major conclusions are that (1) base modification considerably sharpens the definition of the ground state structure by constraining energetically adjacent structures to be similar to the ground state, and (2) sequences whose ground state structure is thermodynamically well defined show a significant tendency to buffer single point mutations. This can have evolutionary implications, since selection pressure to improve the definition of ground states with biological function may result in increased neutrality.     

Evolutionary changes in protein composition — evidence for an optimal strategy

The information contained in the composition of different proteins of the same family is analyzed. It is found that within each family the gain in information per amino acid replacement is constant. This finding is interpreted to imply that evolutionary changes in proteins follow an "optimal" path in the sense that they maximize the number of potentially functional sequences that can be generated by T accepted point mutations from a given protein, subject to restrictions due to biological function.     

Seasonal Rotifer Dynamics in the Long-term (1969–2002) Record from Lake Kinneret (Israel)

Long-term (1969–2002) data record of biomass distribution of rotifers in Lake Kinneret is combined with previously published information on their metabolic activity and newly calculated population dynamics parameters to synthesize a model of their seasonal dynamics in Lake Kinneret. Nineteen rotifer species were recorded in routine samples collected in Lake Kinneret (Israel) in 7 offshore (deeper than 5 m), stations, at 12 discrete depths during 1969–2002. Organisms were sorted and counted (including external egg carrying females), biomass was measured and calculated for the entire lake stock (g_w.w m⁻²; mg l⁻¹). Rates of grazing, respiration and production were measured experimentally at three different temperature ranges. Results were extrapolated to the lake community for months with similar temperatures. Rotifera comprised 7% of total zooplankton biomass in Lake Kinneret whilst Cladocera and Copepoda 58 and 35% respectively. Rotifers were found to be more abundant during December–June and decline in summer months. Monthly (1969–2001) means indicated total grazing capacity of rotifers as 11%, respiration as 9% and production as 3.7% of the total zooplankton metabolic activity. Positive relations were indicated between rotifer and small bodied cladoceran numerical concentrations. Population growth models suggest that rotifers are not food limited in Lake Kinneret but that fish predation plays an important role in regulating abundance in spring-summer and fall.     

Concurrent Neutral Evolution of mRNA Secondary Structures and Encoded Proteins

Messenger RNA sequences often have to preserve functional secondary structure elements in addition to coding for proteins. We present a statistical analysis of retroviral mRNA which supports the hypothesis that the natural genetic code is adapted to such complementary coding. These sequences are still able to explore efficiently the space of possible proteins by point mutations. This is borne out by the observation that, in stem regions of retroviral mRNA foldings, silent mutations on one strand are preferentially accompanied by conservative mutations on the other. Distances between amino acids based on physicochemical properties are used to quantify the conservation of protein function under the constraint of maintained RNA secondary structure. We find that preservation of RNA secondary structure by compensatory mutations is evolutionary compatible with the efficient search for new variants on the protein level. Received: 4 June 1999 / Accepted: 12 October 1999     

Prediction of locally stable RNA secondary structures for genome-wide surveys

MOTIVATION: Recently novel classes of functional RNAs, most prominently the miRNAs have been discovered, strongly suggesting that further types of functional RNAs are still hidden in the recently completed genomic DNA sequences. Only few techniques are known, however, to survey genomes for such RNA genes. When sufficiently similar sequences are not available for comparative approaches the only known remedy is to search directly for structural features. RESULTS: We present here efficient algorithms for computing locally stable RNA structures at genome-wide scales. Both the minimum energy structure and the complete matrix of base pairing probabilities can be computed in theta(N x L2) time and theta(N + L2) memory in terms of the length N of the genome and the size L of the largest secondary structure motifs of interest. In practice, the 100 Mb of the complete genome of Caenorhabditis elegans can be folded within about half a day on a modern PC with a search depth of L = 100. This is sufficient example for a survey for miRNAs. AVAILABILITY: The software described in this contribution will be available for download at http://www.tbi.univie.ac.at/~ivo/RNA/ as part of the Vienna RNA Package.     

Prediction of RNA base pairing probabilities on massively parallel computers.

We present an implementation of McCaskill's algorithm for computing the base pair probabilities of an RNA molecule for massively parallel message passing architectures. The program can be used to routinely fold RNA sequences of more than 10,000 nucleotides. Applications to complete viral genomes are discussed.