| Prediction for RNA planar pseudoknots |
| |
| 作者姓名： | Li Hengwu Zhu Daming Liu Zhendong and Li Hong |
| |
| 作者单位： | 1. School of Computer Science and Technology，Shandong University，Jinan 250100，China; 2. Department of Computer，Shandong Economic University，Jinan 250014，China |
| |
| 基金项目： | 国家自然科学基金;山东省自然科学基金 |
| |
| 摘 要： | Based on m-stems and semi-extensible structure, a model is presented to represent RNA planar pseudoknots, and corresponding dynamic programming algorithm is designed and implemented to predict arbitrary planar pseudoknots and simple non-planar pseudoknots with O(n4) time and O(n3) space. The algorithm folds total 245 sequences in the Pseudobase database, and the test results indicate that the algorithm has good accuracy, sensitivity and specificity.
|
Prediction for RNA planar pseudoknots |
| |
| Li Hengwu,,Zhu Daming,Liu Zhendong and Li Hong.Prediction for RNA planar pseudoknots[J].Progress in Natural Science,2007,17(6):717-724. |
| |
| Authors: | Li Hengwu Zhu Daming Liu Zhendong Li Hong |
| |
| Abstract: | Based on m-stems and semi-extensible structure, a model is presented to represent RNA planar pseudoknots, and corresponding dynamic programming algorithm is designed and implemented to predict arbitrary planar pseudoknots and simple non-planar pseudoknots with O(n4) time and O(n3) space. The algorithm folds total 245 sequences in the Pseudobase database, and the test results indicate that the algorithm has good accuracy, sensitivity and specificity. |
| |
| Keywords: | algorithm RNA secondary structure pseudoknot dynamic programming |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《自然科学进展(英文版)》浏览原始摘要信息 |
| 点击此处可从《自然科学进展(英文版)》下载免费的PDF全文 |
