Variations on RNA folding and alignment: lessons from Benasque

Dynamic programming algorithms solve many standard problems of RNA bioinformatics in polynomial time. In this contribution we discuss a series of variations on these standard methods that implement refined biophysical models, such as a restriction of RNA folding to canonical structures, and an exten...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of mathematical biology Jg. 56; H. 1-2; S. 129 - 144
Hauptverfasser: Bompfünewerer, Athanasius F., Backofen, Rolf, Bernhart, Stephan H., Hertel, Jana, Hofacker, Ivo L., Stadler, Peter F., Will, Sebastian
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Berlin/Heidelberg Springer-Verlag 01.01.2008
Springer Nature B.V
Schlagworte:
ISSN:0303-6812, 1432-1416
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Dynamic programming algorithms solve many standard problems of RNA bioinformatics in polynomial time. In this contribution we discuss a series of variations on these standard methods that implement refined biophysical models, such as a restriction of RNA folding to canonical structures, and an extension of structural alignments to an explicit scoring of stacking propensities. Furthermore, we demonstrate that a local structural alignment can be employed for ncRNA gene finding. In this context we discuss scanning variants for folding and alignment algorithms.
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0303-6812
1432-1416
DOI:10.1007/s00285-007-0107-5