Abstract
Computational prediction of RNA secondary structures has been an active area of research over the past decades and since become of great relevance for practical applications in structural biology. To date, many popular state-of-the-art prediction tools have the same worst-case time and space requirements of \(\mathcal{O}(n^3)\) and \(\mathcal{O}(n^2)\) for sequence length n, limiting their applicability for practical purposes. Accordingly, biologists are interested in getting results faster, where a moderate loss of accuracy would willingly be tolerated in favor of saving a significant amount of computation time. Motivated by these facts, we invented a novel algorithm for predicting the secondary structure of RNA molecules that manages to reduce the worst-case time complexity by a linear factor to \(\mathcal{O}(n^2)\), while on the other hand it is still capable of producing highly accurate results. Basically, the presented method relies on a probabilistic statistical sampling approach which is actually based on an appropriate stochastic context-free grammar (SCFG): for any given input sequence, it generates a random set of candidate structures (from the ensemble of all feasible foldings) according to a “noisy” distribution (obtained by heuristically approximating the inside-outside values for the input sequence), such that finally a corresponding prediction can be efficiently derived. Notably, this method may be employed with different sampling strategies. Therefore, we not only consider a popular common strategy but also introduce a novel one that is supposed to fit especially well in connection with fuzzy stochastic models. A major advantage of the proposed prediction approach is that sampling can easily be parallelized on modern multi-core architectures or grids. Furthermore, it can be done in-place, that is only the best (here most probable) candidate structure(s) generated so far need(s) to be stored and finally collected. The combination of these two benefits immediately allows for an efficient handling of the increased sample sizes that are often necessary to achieve competitive prediction accuracy in connection with the noisy distribution.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ding, Y., Lawrence, C.E.: A statistical sampling algorithm for RNA secondary structure prediction. Nucleic Acids Research 31, 7280–7301 (2003)
Ding, Y., Chan, C.Y., Lawrence, C.E.: Sfold web server for statistical folding and rational design of nucleic acids. Nucleic Acids Research 32, W135–W141 (2004)
McCaskill, J.S.: The equilibrium partition function and base pair binding probabilities for RNA secondary structure. Biopolymers 29, 1105–1119 (1990)
Nebel, M.E., Scheid, A.: Evaluation of a sophisticated SCFG design for RNA secondary structure prediction. Theory in Biosciences 130, 313–336 (2011)
Zuker, M.: On finding all suboptimal foldings of an RNA molecule. Science 244, 48–52 (1989)
Zuker, M.: Mfold web server for nucleic acid folding and hybridization prediction. Nucleic Acids Res. 31, 3406–3415 (2003)
Hofacker, I., Fontana, W., Stadler, P., Bonhoeffer, S., Tacker, M., Schuster, P.: Fast folding and comparison of rna secondary structures (the Vienna RNA package). Monatsh Chem. 125, 167–188 (1994)
Hofacker, I.L.: The vienna RNA secondary structure server. Nucleic Acids Research 31, 3429–3431 (2003)
Knudsen, B., Hein, J.: RNA secondary structure prediction using stochastic context-free grammars and evolutionary history. Bioinformatics 15, 446–454 (1999)
Knudsen, B., Hein, J.: Pfold: RNA secondary structure prediction using stochastic context-free grammars. Nucleic Acids Research 31, 3423–3428 (2003)
Wexler, Y., Zilberstein, C., Ziv-Ukelson, M.: A study of accessible motifs and RNA folding complexity. Journal of Computational Biology 14, 856–872 (2007)
Backofen, R., Tsur, D., Zakov, S., Ziv-Ukelson, M.: Sparse RNA folding: Time and space efficient algorithms. Journal of Discrete Algorithms 9, 12–31 (2011)
Frid, Y., Gusfield, D.: A simple, practical and complete \(\mathcal{O}(n^3 / \log(n))\)-time algorithm for RNA folding using the Four-Russians speedup. Algorithms for Molecular Biology 5, 5–13 (2010)
Akutsu, T.: Approximation and exact algorithms for RNA secondary structure prediction and recognition of stochastic context-free languages. J. Comb. Optim. 3, 321–336 (1999)
Sprinzl, M., Horn, C., Brown, M., Ioudovitch, A., Steinberg, S.: Compilation of tRNA sequences and sequences of tRNA genes. Nucleic Acids Res. 26, 148–153 (1998)
Do, C.B., Woods, D.A., Batzoglou, S.: CONTRAfold: RNA secondary structure prediction without physics-based models. Bioinformatics 22, e90–e98 (2006)
Dowell, R.D., Eddy, S.R.: Evaluation of several lightweight stochastic context-free grammars for RNA secondary structure prediction. BMC Bioinformatics 5, 71 (2004)
Scheid, A.: Sampling and Approximation in the Context of RNA Secondary Structure Prediction, PhD-Thesis Kaiserslautern University, Germany (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nebel, M.E., Scheid, A. (2013). Fast RNA Secondary Structure Prediction Using Fuzzy Stochastic Models. In: Gabriel, J., et al. Biomedical Engineering Systems and Technologies. BIOSTEC 2012. Communications in Computer and Information Science, vol 357. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38256-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-38256-7_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38255-0
Online ISBN: 978-3-642-38256-7
eBook Packages: Computer ScienceComputer Science (R0)