Memory efficient folding algorithms for circular RNA secondary structures
| dc.contributor.author | Hofacker, Ivo L. | |
| dc.contributor.author | Stadler, Peter F. | |
| dc.contributor.editor | Torda, Andrew | |
| dc.contributor.editor | Kurtz, Stefan | |
| dc.contributor.editor | Rarey, Matthias | |
| dc.date.accessioned | 2019-08-27T08:22:37Z | |
| dc.date.available | 2019-08-27T08:22:37Z | |
| dc.date.issued | 2005 | |
| dc.description.abstract | 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. | en |
| dc.identifier.isbn | 3-88579-400-4 | |
| dc.identifier.pissn | 1617-5468 | |
| dc.identifier.uri | https://dl.gi.de/handle/20.500.12116/24936 | |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik e.V. | |
| dc.relation.ispartof | German Conference on Bioinformatics 2005 (GCB 2005) | |
| dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-71 | |
| dc.title | Memory efficient folding algorithms for circular RNA secondary structures | en |
| dc.type | Text/Conference Paper | |
| gi.citation.endPage | 25 | |
| gi.citation.publisherPlace | Bonn | |
| gi.citation.startPage | 15 | |
| gi.conference.date | 5.-7. Oktober 2005 | |
| gi.conference.location | Hamburg | |
| gi.conference.sessiontitle | Regular Research Papers |
Dateien
Originalbündel
1 - 1 von 1
Lade...
- Name:
- GI-Proceedings.71-3.pdf
- Größe:
- 242.83 KB
- Format:
- Adobe Portable Document Format