Answers are grounded in this paper and cite their sources.
A computer method is presented for finding the most stable secondary structures in long single-stranded RNAs. It is 1-2 orders of magnitude faster than existing codes. The time required for its application increases as N3 for a chain N nucleotides long. As many as 1000 nucleotides can be searched in a single run. The approach is systematic and builds an optimal structure in a straightforward inductive procedure based on an exact mathematical algorithm. Two simple half-matrices are constructed and the best folded form is read directly from the second matrix by a simple back-tracking procedure. The program utilizes published values for base-pairing energies to compute one structure with the lowest free energy.
No takes yet. Share an insight, caveat, or question.
Nussinov et al. (1980) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: