Skip to main content
SpringerLink
Log in

How do RNA folding algorithms work?

  • Primer
  • Published:

From Nature Biotechnology

View current issue Submit your manuscript

Programs such as MFOLD and ViennaRNA are widely used to predict RNA secondary structures. How do these algorithms work? Why can't they predict RNA pseudoknots? How accurate are they, and will they get better?

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Figure 1: Dynamic programming algorithm for RNA secondary structure prediction.

Similar content being viewed by others

References

  1. Zuker, M. Calculating nucleic acid secondary structure. Curr. Opin. Struct. Biol. 10, 303–310 (2000).

    Article  CAS  PubMed  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Howard Hughes Medical Institute & Department of Genetics, Washington University School of Medicine, 4444 Forest Park Blvd., Box 8510, Saint Louis, 63108, Missouri, USA

    Sean R Eddy

Authors
  1. Sean R Eddy
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Eddy, S. How do RNA folding algorithms work?. Nat Biotechnol 22, 1457–1458 (2004). https://doi.org/10.1038/nbt1104-1457

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1038/nbt1104-1457

  • Springer Nature America, Inc.

This article is cited by

Search

Navigation