𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Folding of branched RNA species

✍ Scribed by David M. J. Lilley

Publisher
Wiley (John Wiley & Sons)
Year
1998
Tongue
English
Weight
143 KB
Volume
48
Category
Article
ISSN
0006-3525

No coin nor oath required. For personal study only.

✦ Synopsis

The global structures of branched RNA species are important to their function. Branched RNA species are defined as molecules in which double-helical segments are interrupted by abrupt discontinuities. These include helical junctions of different orders, and base bulges and loops. Common helical junctions are three-and four-way junctions, often interrupted by mispairs or additional nucleotides. There are many interesting examples of functional RNA junctions, including the hammerhead and hairpin ribozymes, and junctions that serve as binding sites for proteins. The junctions display some common structural properties. These include a tendency to undergo pairwise helical stacking and ion-induced conformational transitions. Helical branchpoints can act as key architectural components and as important sites for interactions with proteins.

πŸ“œ SIMILAR VOLUMES

Kinetic Footprinting of an RNA-Folding P
Kinetic Footprinting of an RNA-Folding Pathway Using Peroxynitrous Acid
✍ Steven G. Chaulk; Andrew M. MacMillan πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 94 KB

Complex RNA molecules are at the heart of a number of fundamental biological processes, including translation, tRNA maturation, and RNA splicing. [1] The unique threedimensional structures adopted by these molecules determine their activity and in some cases, such as the assembly of the spliceosome,

Complete suboptimal folding of RNA and t
Complete suboptimal folding of RNA and the stability of secondary structures
✍ Stefan Wuchty; Walter Fontana; Ivo L. Hofacker; Peter Schuster πŸ“‚ Article πŸ“… 1999 πŸ› Wiley (John Wiley & Sons) 🌐 English βš– 317 KB πŸ‘ 2 views

An algorithm is presented for generating rigorously all suboptimal secondary structures between the minimum free energy and an arbitrary upper limit. The algorithm is particularly fast in the vicinity of the minimum free energy. This enables the efficient approximation of statistical quantities, suc