Logo des Repositoriums
 
Konferenzbeitrag

Memory efficient folding algorithms for circular RNA secondary structures

Lade...
Vorschaubild

Volltext URI

Dokumententyp

Text/Conference Paper

Zusatzinformation

Datum

2005

Zeitschriftentitel

ISSN der Zeitschrift

Bandtitel

Verlag

Gesellschaft für Informatik e.V.

Zusammenfassung

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. Here we describe how circular secondary structures can be obtained without additional memory requirements as a kind of "post-processing" of the linear structures.

Beschreibung

Hofacker, Ivo L.; Stadler, Peter F. (2005): Memory efficient folding algorithms for circular RNA secondary structures. German Conference on Bioinformatics 2005 (GCB 2005). Bonn: Gesellschaft für Informatik e.V.. PISSN: 1617-5468. ISBN: 3-88579-400-4. pp. 15-25. Regular Research Papers. Hamburg. 5.-7. Oktober 2005

Schlagwörter

Zitierform

DOI

Tags