Return to search

Memory efficient folding algorithms for circular RNA secondary structures

Background: A small class of RNA molecules, in particular the tiny genomes of viroids, are circular. Yet most structure prediction algorithms handle only linear RNAs. The most straightforward approach is to compute circular structures from ‘internal’ and ‘external’ substructures separated by a base pair. This is incompatible, however, with the memory-saving approach of the Vienna RNA Package which builds a linear RNA structure from shorter (internal) structures only.

Result: Here we describe how circular secondary structures can be obtained without additional memory requirements as a kind of ‘post-processing’ of the linear structures.

Identiferoai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:32112
Date06 November 2018
CreatorsHofacker, Ivo L., Stadler, Peter F.
Source SetsHochschulschriftenserver (HSSS) der SLUB Dresden
LanguageEnglish
Detected LanguageEnglish
Typeinfo:eu-repo/semantics/publishedVersion, doc-type:article, info:eu-repo/semantics/article, doc-type:Text
Rightsinfo:eu-repo/semantics/openAccess
Relation1460-2059

Page generated in 0.0021 seconds