RNA假结预测的茎重最大化方案

Y. L. Leo, Y. K. Goh
{"title":"RNA假结预测的茎重最大化方案","authors":"Y. L. Leo, Y. K. Goh","doi":"10.1109/STUDENT.2012.6408398","DOIUrl":null,"url":null,"abstract":"An RNA pseudoknot prediction algorithm based on maximization of stem weight is proposed. The algorithm involves three stem searching function that is section search, cross search and knot search which search for base pairing in different regions. Section search identifies simple RNA stems and loops without crossing. Cross search will search for inner base pairing without crossing of stems found in section search. Finally, knot search which search for potential pseudoknot structures by searching for base pairing between hairpin loop and other unpaired regions. The resulting secondary structure is represented in dot-bracket representation and could be visualized with VARNA [1]. A total of 110 RNA secondary structures downloaded from FRABASE [2] are compared with structures generated by the proposed algorithm. Structure comparison is carried out by calculating the specificity (SP) and sensitivity (SN) scores between the predicted structure to the experimentally determined structure from FRABASE.","PeriodicalId":282263,"journal":{"name":"2012 IEEE Conference on Sustainable Utilization and Development in Engineering and Technology (STUDENT)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A stem weight maximization scheme for RNA pseudoknot prediction\",\"authors\":\"Y. L. Leo, Y. K. Goh\",\"doi\":\"10.1109/STUDENT.2012.6408398\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An RNA pseudoknot prediction algorithm based on maximization of stem weight is proposed. The algorithm involves three stem searching function that is section search, cross search and knot search which search for base pairing in different regions. Section search identifies simple RNA stems and loops without crossing. Cross search will search for inner base pairing without crossing of stems found in section search. Finally, knot search which search for potential pseudoknot structures by searching for base pairing between hairpin loop and other unpaired regions. The resulting secondary structure is represented in dot-bracket representation and could be visualized with VARNA [1]. A total of 110 RNA secondary structures downloaded from FRABASE [2] are compared with structures generated by the proposed algorithm. Structure comparison is carried out by calculating the specificity (SP) and sensitivity (SN) scores between the predicted structure to the experimentally determined structure from FRABASE.\",\"PeriodicalId\":282263,\"journal\":{\"name\":\"2012 IEEE Conference on Sustainable Utilization and Development in Engineering and Technology (STUDENT)\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE Conference on Sustainable Utilization and Development in Engineering and Technology (STUDENT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/STUDENT.2012.6408398\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE Conference on Sustainable Utilization and Development in Engineering and Technology (STUDENT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/STUDENT.2012.6408398","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

提出了一种基于茎重最大化的RNA假结预测算法。该算法包含三个搜索功能:分段搜索、交叉搜索和结搜索,分别用于搜索不同区域的碱基配对。部分搜索识别简单的RNA茎和环没有交叉。交叉搜索将搜索内部碱基配对,而不交叉在切片搜索中找到的茎。最后是结搜索,通过搜索发夹环与其他未配对区域之间的碱基配对来搜索潜在的假结结构。得到的二级结构用点括号表示,可以用VARNA可视化[1]。从FRABASE[2]下载的110个RNA二级结构与本文算法生成的结构进行了比较。通过计算预测结构与FRABASE实验确定结构的特异性(SP)和敏感性(SN)评分,进行结构比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A stem weight maximization scheme for RNA pseudoknot prediction
An RNA pseudoknot prediction algorithm based on maximization of stem weight is proposed. The algorithm involves three stem searching function that is section search, cross search and knot search which search for base pairing in different regions. Section search identifies simple RNA stems and loops without crossing. Cross search will search for inner base pairing without crossing of stems found in section search. Finally, knot search which search for potential pseudoknot structures by searching for base pairing between hairpin loop and other unpaired regions. The resulting secondary structure is represented in dot-bracket representation and could be visualized with VARNA [1]. A total of 110 RNA secondary structures downloaded from FRABASE [2] are compared with structures generated by the proposed algorithm. Structure comparison is carried out by calculating the specificity (SP) and sensitivity (SN) scores between the predicted structure to the experimentally determined structure from FRABASE.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信