An iterative loop matching approach to the prediction of RNA secondary structures with pseudoknots

Jianhua Ruan, G. Stormo, Weixiong Zhang
{"title":"An iterative loop matching approach to the prediction of RNA secondary structures with pseudoknots","authors":"Jianhua Ruan, G. Stormo, Weixiong Zhang","doi":"10.1109/CSB.2003.1227394","DOIUrl":null,"url":null,"abstract":"In this paper we present a heuristic algorithm, iterative loop matching, for predicting RNA pseudoknots. The method can utilize either thermodynamic or comparative information or both, thus is able to predict for both aligned and individual sequences. Using 8-12 homologous sequences, the algorithm correctly identifies more than 90% of base-pairs for short sequences and 80% overall. It correctly predicts nearly all pseudoknots, while having very few false predictions. Comparisons show that our algorithm is more sensitive and more specific than existing methods. In addition, our algorithm is very efficient and can be applied to sequences up to several thousands of bases long.","PeriodicalId":147883,"journal":{"name":"Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003","volume":"62 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"240","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSB.2003.1227394","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 240

Abstract

In this paper we present a heuristic algorithm, iterative loop matching, for predicting RNA pseudoknots. The method can utilize either thermodynamic or comparative information or both, thus is able to predict for both aligned and individual sequences. Using 8-12 homologous sequences, the algorithm correctly identifies more than 90% of base-pairs for short sequences and 80% overall. It correctly predicts nearly all pseudoknots, while having very few false predictions. Comparisons show that our algorithm is more sensitive and more specific than existing methods. In addition, our algorithm is very efficient and can be applied to sequences up to several thousands of bases long.
带假结的RNA二级结构预测的迭代环匹配方法
在本文中,我们提出了一种启发式算法,迭代循环匹配,预测RNA假结。该方法既可以利用热力学信息,也可以利用比较信息,或者两者兼有,因此既可以预测排列序列,也可以预测单个序列。使用8-12个同源序列,该算法对短序列的碱基对识别率超过90%,整体识别率为80%。它正确地预测了几乎所有的假结,而很少有错误的预测。对比表明,该算法比现有方法更灵敏、更具体。此外,我们的算法非常高效,可以应用于长达数千个碱基的序列。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信