{"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}
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.