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