CyloFold: secondary structure prediction including pseudoknots
نویسندگان
چکیده
UNLABELLED Computational RNA secondary structure prediction approaches differ by the way RNA pseudoknot interactions are handled. For reasons of computational efficiency, most approaches only allow a limited class of pseudoknot interactions or are not considering them at all. Here we present a computational method for RNA secondary structure prediction that is not restricted in terms of pseudoknot complexity. The approach is based on simulating a folding process in a coarse-grained manner by choosing helices based on established energy rules. The steric feasibility of the chosen set of helices is checked during the folding process using a highly coarse-grained 3D model of the RNA structures. Using two data sets of 26 and 241 RNA sequences we find that this approach is competitive compared to the existing RNA secondary structure prediction programs pknotsRG, HotKnots and UnaFold. The key advantages of the new method are that there is no algorithmic restriction in terms of pseudoknot complexity and a test is made for steric feasibility. AVAILABILITY The program is available as web server at the site: http://cylofold.abcc.ncifcrf.gov.
منابع مشابه
P-dcfold or How to Predict all Kinds of Pseudoknots in Rna Secondary Structures
Pseudoknots play important roles in many RNAs. But for computational reasons, pseudoknots are usually excluded from the definition of RNA secondary structures. Indeed, prediction of pseudoknots increase very highly the complexities in time of the algorithms, knowing that all existing algorithms for RNA secondary structure prediction have complexities at least of O(n). Some algorithms have been ...
متن کاملRNA Secondary Structure Prediction Algorithms
RNA secondary structure prediction is an important problem studied extensively in the past three dacades. However, pseudoknots are usually excluded in RNA secondary structure prediction due to the hardness of examining all possible structures efficiently and model the energy correctly. Current algorithms on predicting structures with pseudoknots usually have extremely high resource requirements...
متن کاملMMKnots: A max-margin model for RNA secondary structure prediction including pseudoknots
Motivation: The ideal algorithm for the prediction of pseudoknotted RNA secondary structures will provide fast and accurate predictions for pseudoknots of arbitrary complexity. However, existing algorithms are typically lacking on one of these three axes. Energy-based methods suffer from the intractability of pseudoknotted structure prediction under realistic energy models, while statistical ap...
متن کاملP-DCFold: an algorithm for RNA secondary structure prediction including all kinds of pseudoknots
Pseudoknots in RNA secondary structures play important roles, but unfortunately, their prediction is a very difficult task. The prediction of a RNA secondary structure still being not resolved, even when it does not contain pseudoknots. Many algorithms have been proposed, but almost of them are not satisfactory in results and complexities. Particularly, when pseudoknots are taken into account, ...
متن کاملDP Algorithms for RNA Secondary Structure Prediction with Pseudoknots
This paper describes simple DP (dynamic programming) algorithms for RNA secondary structure prediction with pseudoknots, for which no explicit DP algorithm had been known. Results of preliminary computational experiments are described too.
متن کامل