Topology and Prediction of RNA Pseudoknots

Bioinformatics. 2011 Apr 15;27(8):1076-85. doi: 10.1093/bioinformatics/btr090. Epub 2011 Feb 17.

Abstract

Motivation: Several dynamic programming algorithms for predicting RNA structures with pseudoknots have been proposed that differ dramatically from one another in the classes of structures considered.

Results: Here, we use the natural topological classification of RNA structures in terms of irreducible components that are embeddable in the surfaces of fixed genus. We add to the conventional secondary structures four building blocks of genus one in order to construct certain structures of arbitrarily high genus. A corresponding unambiguous multiple context-free grammar provides an efficient dynamic programming approach for energy minimization, partition function and stochastic sampling. It admits a topology-dependent parametrization of pseudoknot penalties that increases the sensitivity and positive predictive value of predicted base pairs by 10-20% compared with earlier approaches. More general models based on building blocks of higher genus are also discussed.

Availability: The source code of gfold is freely available at http://www.combinatorics.cn/cbpc/gfold.tar.gz.

Contact: duck@santafe.edu

Supplementary information: Supplementary data are available at Bioinformatics online.

Publication types

  • Research Support, Non-U.S. Gov't

MeSH terms

  • Algorithms
  • Base Pairing
  • Nucleic Acid Conformation
  • RNA / chemistry*
  • RNA / classification
  • Sequence Analysis, RNA
  • Software

Substances

  • RNA