IDEAS home Printed from https://ideas.repec.org/p/wop/safiwp/96-04-016.html
   My bibliography  Save this paper

Algorithmic Independence Properties of RNA Secondary Structure Predictions

Author

Listed:
  • 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). Key words. kinetic folding, minimum free energy structures, RNA secondary structures, sequence structure relations

Suggested Citation

  • Manfred Tacker & Peter F. Stadler & Erich G. Bornberg-Bauer & Ivo L. Hofacker & Peter Schuster, 1996. "Algorithmic Independence Properties of RNA Secondary Structure Predictions," Working Papers 96-04-016, Santa Fe Institute.
    • Handle: RePEc:wop:safiwp:96-04-016
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below 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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Laurie J. Heyer, 2000. "A Generalized Erdös-Rényi Law for Sequence Analysis Problems," Methodology and Computing in Applied Probability, Springer, vol. 2(3), pages 309-329, September.
    2. Aderonke Babajide & Ivo L. Hofacker & Manfred J. Sippl & Peter F. Stadler, 1996. "Neutral Networks in Protein Space," Working Papers 96-12-085, Santa Fe Institute.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wop:safiwp:96-04-016. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Thomas Krichel (email available below). General contact details of provider: https://edirc.repec.org/data/epstfus.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.