Show simple item record

dc.contributor.authorHofacker, Ivo L.
dc.contributor.authorStadler, Peter F.
dc.contributor.editorTorda, Andrew
dc.contributor.editorKurtz, Stefan
dc.contributor.editorRarey, Matthias
dc.date.accessioned2019-08-27T08:22:37Z
dc.date.available2019-08-27T08:22:37Z
dc.date.issued2005
dc.identifier.isbn3-88579-400-4
dc.identifier.issn1617-5468
dc.identifier.urihttp://dl.gi.de/handle/20.500.12116/24936
dc.description.abstractA 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.en
dc.language.isoen
dc.publisherGesellschaft für Informatik e.V.
dc.relation.ispartofGerman Conference on Bioinformatics 2005 (GCB 2005)
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Proceedings, Volume P-71
dc.titleMemory efficient folding algorithms for circular RNA secondary structuresen
dc.typeText/Conference Paper
dc.pubPlaceBonn
mci.reference.pages15-25
mci.conference.sessiontitleRegular Research Papers
mci.conference.locationHamburg
mci.conference.date5.-7. Oktober 2005


Files in this item

Thumbnail

Show simple item record