Fast folding and comparison of RNA secondary structures

@article{Hofacker1994FastFA,
  title={Fast folding and comparison of RNA secondary structures},
  author={Ivo L. Hofacker and Walter Fontana and Peter F. Stadler and L. S. Bonhoeffer and Manfred Tacker and Peter Schuster},
  journal={Monatshefte f{\"u}r Chemie / Chemical Monthly},
  year={1994},
  volume={125},
  pages={167-188}
}
SummaryComputer codes for computation and comparison of RNA secondary structures, the Vienna RNA package, are presented, that are based on dynamic programming algorithms and aim at predictions of structures with minimum free energies as well as at computations of the equilibrium partition functions and base pairing probabilities.An efficient heuristic for the inverse folding problem of RNA is introduced. In addition we present compact and efficient programs for the comparison of RNA secondary… 
Analysis of RNA sequence structure maps by exhaustive enumeration I. Neutral networks
SummaryGlobal relations between RNA sequences and secondary structures are understood as mappings from sequence space into shape space. These mappings are investigated by exhaustive folding of allGC
RNA secondary structure prediction using hierarchical folding
TLDR
The HFold algorithm, based on work of S. Zhao, uses two-phase energy minimization to predict hierarchically-formed secondary structures in O(n) time, matching the complexity of the best algorithms for pseudoknot free secondary structure prediction via energy minimized.
RNA Secondary Structures with Limited Base Pair Span: Exact Backtracking and an Application
TLDR
An efficient backtracking algorithm is reported on that reconstructs the globally optimal structure from the locally optimal fragments that are produced by the interleaved backtracking implemented in RNALfold, integrated into the ViennaRNA package.
Algorithms for the study of RNA and protein structure
TLDR
A system to automatically generate two-dimensional representations of protein structure that are particularly useful in analysing complex protein folds and a method for using these diagrams as an interface to the protein substructure search methods.
Analysis of RNA sequence structure maps by exhaustive enumeration II. Structures of neutral networks and shape space covering
SummaryThe relations between RNA sequences and secondary structures are investigated by exhaustive folding of allGC andAU sequences with chain lengths up to 30. The technique oftries is used for
GTfold: a scalable multicore code for RNA secondary structure prediction
TLDR
A new parallel multicore and scalable program called GTfold is presented, which is one to two orders of magnitude faster than the de facto standard programs and achieves comparable accuracy of prediction and the exact algorithms like internal loop speedup can be implemented with the method in an affordable amount of time.
ViennaRNA Package 2.0
TLDR
New features include an expanded repertoire of tools to assess RNA-RNA interactions and restricted ensembles of structures, additional output information such as centroid structures and maximum expected accuracy structures derived from base pairing probabilities, or z-scores for locally stable secondary structures, and support for input in fasta format.
Partition function and base pairing probabilities for RNA-RNA interaction prediction
TLDR
This work presents an O(N(6) time and O(4) time dynamics programming algorithm for computing the full partition function for RIP which is based on the combinatorial notion of 'tight structures', equivalent to recent work by H. Chitsaz and collaborators.
Folding kinetics of large RNAs.
TLDR
A heuristic approach to kinetic RNA folding that constructs secondary structures by stepwise combination of building blocks that correspond to subsequences and their thermodynamically optimal structures is introduced.
Abstract shapes of RNA.
TLDR
This study formalizes the concept of abstract shapes and introduces their efficient computation, and applied RNAshapes to the prediction of optimal and suboptimal abstract shapes of several RNAs, demonstrating that the researcher can quickly focus on the structures of interest, without processing up to thousands of near-optimal solutions.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 61 REFERENCES
Statistics of landscapes based on free energies, replication and degradation rate constants of RNA secondary structures
SummaryRNA secondary structures are computed from primary sequences by means of a folding algorithm which uses a minimum free energy criterion. Free energies as well as replication and degradation
Statistics of RNA secondary structures
TLDR
A statistical reference for RNA secondary structures with minimum free energies is computed by folding large ensembles of random RNA sequences, using two binary alphabets, AU and GC, the biophysical AUGC and the synthetic GCXK alphabet.
Optimal computer folding of large RNA sequences using thermodynamics and auxiliary information
TLDR
A new computer method for folding an RNA molecule that finds a conformation of minimum free energy using published values of stacking and destabilizing energies and is much more efficient, faster, and can fold larger molecules than procedures which have appeared up to now in the biological literature.
Pattern analysis of RNA secondary structure similarity and consensus of minimal-energy folding.
TLDR
An automated procedure to search for consensus structures or substructures in a set of homologous or related RNA molecules based on the calculation of optimal and sub-optimal secondary structures using thermodynamic rules for base-pairing by energy-minimization is described.
Rna Secondary Structures and Their Prediction 1
This is a review of past and present attempts to predict the secondary structure of ribo-nucleic acids (RNAs) through mathematical and computer methods. Related areas covering classification,
On finding all suboptimal foldings of an RNA molecule.
TLDR
The mathematical problem of determining how well defined a minimum energy folding is can now be solved and all predicted base pairs that can participate in suboptimal structures may be displayed and analyzed graphically.
Fast algorithm for predicting the secondary structure of single-stranded RNA.
  • R. Nussinov, A. Jacobson
  • Chemistry, Medicine
    Proceedings of the National Academy of Sciences of the United States of America
  • 1980
TLDR
A computer method is presented for finding the most stable secondary structures in long single-stranded RNAs and builds an optimal structure in a straightforward inductive procedure based on an exact mathematical algorithm.
Improved predictions of secondary structures for RNA.
TLDR
The accuracy of computer predictions of RNA secondary structure from sequence data and free energy parameters has been increased to roughly 70% and the excellent performance is consistent with these interactions being the primary interactions determiningRNA secondary structure.
The equilibrium partition function and base pair binding probabilities for RNA secondary structure
TLDR
A novel application of dynamic programming to the folding problem for RNA enables one to calculate the full equilibrium partition function for secondary structure and the probabilities of various substructures by a recursive scheme of polynomial order N3 in the sequence length N.
RNA folding and combinatory landscapes.
  • Fontana, Stadler, +6 authors Schuster
  • Mathematics, Medicine
    Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics
  • 1993
TLDR
This paper views the folding of polynucleotide (RNA) sequences as a map that assigns to each sequence a minimum-free-energy pattern of base pairings, known as secondary structure, and makes a detailed comparison between the energy landscapes derived from RNA folding and those obtained from the [ital n]-[ital k] model.
...
1
2
3
4
5
...