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.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:32162 |
| Date | 09 November 2018 |
| Creators | Bompfünewerer, Athanasius F., Backofen, Rolf, Bernhart, Stephan H., Hertel, Jana, Hofacker, Ivo L., Stadler, Peter F., Will, Sebastian |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | info:eu-repo/semantics/publishedVersion, doc-type:article, info:eu-repo/semantics/article, doc-type:Text |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | 0303-6812 |
Page generated in 0.0024 seconds