Manfred Tacker Peter F. Stadler Erich G. Bornberg-Bauer Ivo L. Hofacker Peter Schuster
Abstract
Algorithms predicting RNA secondary structures based on different folding criteria---minimum free energy (mfe), kinetic folding (kin), maximum matching (mm)---and different parameter sets are studied systematically. Two base pairing alphabets were used: the binary GC and the natural four-letter AUGC alphabet. Computed structures and free energies depend strongly on both algorithms and parameter sets. Statistical properties, such as mean numbers of base pairs, mean numbers of stacks, mean loop sizes, etc., are much less sensitive to the choices of parameter sets and even algorithms. Some features of RNA secondary structures, like structure correlation functions, shape space covering and neutral networks, seem to depend only on the base pairing logic GC and AUGC alphabet).
To our knowledge, this item is not available for
download. To find whether it is available, there are three
options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page
whether it is in fact available.
3. Perform a search for a similarly titled item that would be
available.
Publisher Info
Paper provided by Santa Fe Institute in its series Working Papers with number
96-04-016.