期刊
JOURNAL OF MATHEMATICAL BIOLOGY
卷 56, 期 1-2, 页码 129-144出版社
SPRINGER HEIDELBERG
DOI: 10.1007/s00285-007-0107-5
关键词
RNA folding; secondary structure alignment; dynamic programming
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据