Journal
JOURNAL OF MATHEMATICAL BIOLOGY
Volume 56, Issue 1-2, Pages 129-144Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s00285-007-0107-5
Keywords
RNA folding; secondary structure alignment; dynamic programming
Categories
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available