包含假结的RNA结构预测的近似算法

Zhendong Liu, Yuxiao Dong, Hengwu Li, Huijian Han
{"title":"包含假结的RNA结构预测的近似算法","authors":"Zhendong Liu, Yuxiao Dong, Hengwu Li, Huijian Han","doi":"10.1109/ICAL.2011.6024736","DOIUrl":null,"url":null,"abstract":"RNA structure and tertiary structure could be represented by a set of nested arcs and a set of crossing arcs. Based on the relative stability of the stems in RNA molecules, an approximating algorithm is presented to predict RNA pseudoknotted structure, the algorithm takes O(n3) time and O(n) space, the algorithm outperforms other known algorithms in predicting accuracy. This algorithm not only reduces the time complexity to O(n3), but also widens the maximum length of the sequence. The preliminary experimental test on the RNA subsequences in PseudoBase confirm that the algorithm has good sensitivity and specificity, and are among the most reasonable in the literature.","PeriodicalId":351518,"journal":{"name":"2011 IEEE International Conference on Automation and Logistics (ICAL)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Approximating algorithm for RNA structure prediction including pseudoknots\",\"authors\":\"Zhendong Liu, Yuxiao Dong, Hengwu Li, Huijian Han\",\"doi\":\"10.1109/ICAL.2011.6024736\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"RNA structure and tertiary structure could be represented by a set of nested arcs and a set of crossing arcs. Based on the relative stability of the stems in RNA molecules, an approximating algorithm is presented to predict RNA pseudoknotted structure, the algorithm takes O(n3) time and O(n) space, the algorithm outperforms other known algorithms in predicting accuracy. This algorithm not only reduces the time complexity to O(n3), but also widens the maximum length of the sequence. The preliminary experimental test on the RNA subsequences in PseudoBase confirm that the algorithm has good sensitivity and specificity, and are among the most reasonable in the literature.\",\"PeriodicalId\":351518,\"journal\":{\"name\":\"2011 IEEE International Conference on Automation and Logistics (ICAL)\",\"volume\":\"76 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-09-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE International Conference on Automation and Logistics (ICAL)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICAL.2011.6024736\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Conference on Automation and Logistics (ICAL)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAL.2011.6024736","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

RNA结构和三级结构可以用一组嵌套弧线和一组交叉弧线来表示。基于RNA分子中茎的相对稳定性,提出了一种预测RNA假结结构的近似算法,该算法只需要O(n3)时间和O(n)空间,在预测精度上优于其他已知算法。该算法不仅将时间复杂度降低到0 (n3),而且拓宽了序列的最大长度。通过对PseudoBase中RNA子序列的初步实验测试,证实该算法具有良好的敏感性和特异性,是文献中最合理的算法之一。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Approximating algorithm for RNA structure prediction including pseudoknots
RNA structure and tertiary structure could be represented by a set of nested arcs and a set of crossing arcs. Based on the relative stability of the stems in RNA molecules, an approximating algorithm is presented to predict RNA pseudoknotted structure, the algorithm takes O(n3) time and O(n) space, the algorithm outperforms other known algorithms in predicting accuracy. This algorithm not only reduces the time complexity to O(n3), but also widens the maximum length of the sequence. The preliminary experimental test on the RNA subsequences in PseudoBase confirm that the algorithm has good sensitivity and specificity, and are among the most reasonable in the literature.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信