Time and Space Efficient RNA-RNA Interaction Prediction via Sparse Folding
In the past years, a large set of new regulatory ncRNAs have been identified, but the number of experimentally verified targets is considerably low. Thus, computational target prediction methods are on high demand. Whereas all previous approaches for predicting a general joint structure have a complexity of O(n 6) running time and O(n 4) space, a more time and space efficient interaction prediction that is able to handle complex joint structures is necessary for genome-wide target prediction problems. In this paper we show how to reduce both the time and space complexity of the RNA-RNA interaction prediction problem as described by Alkan et al.  via dynamic programming sparsification - which allows to discard large portions of DP tables without loosing optimality. Applying sparsification techniques reduces the complexity of the original algorithm from O(n 6) time and O(n 4) space to O(n 4 ψ(n)) time and O(n 2 ψ(n) + n 3) space for some function ψ(n), which turns out to have small values for the range of n that we encounter in practice. Under the assumption that the polymer-zeta property holds for RNA-structures, we demonstrate that ψ(n) = O(n) on average, resulting in a linear time and space complexity improvement over the original algorithm. We evaluate our sparsified algorithm for RNA-RNA interaction prediction by total free energy minimization, based on the energy model of Chitsaz et al., on a set of known interactions. Our results confirm the significant reduction of time and space requirements in practice.
KeywordsCandidate List Joint Structure Interaction Prediction Base Pairing Probability Nucleic Acid Strand
Unable to display preview. Download preview PDF.
- 2.Chitsaz, H., Salari, R., Sahinalp, S.C., Backofen, R.: A partition function algorithm for interacting nucleic acid strands. Bioinformatics (Special ISMB/ECCB 2009 Issue) 25(12), i365–i373 (2009)Google Scholar
- 8.Brantl, S.: Antisense-RNA regulation and RNA interference. Bioch. Biophys. Acta 1575(1-3), 15–25 (2002)Google Scholar
- 16.Huang, F.W., Qin, J., Reidys, C.M., Stadler, P.F.: Partition Function and Base Pairing Probabilities for RNA-RNA Interaction Prediction. Bioinformatics 25(20), 2646–2654 (2009)Google Scholar
- 18.Wexler, Y., Zilberstein, C., Ziv-Ukelson, M.: A study of accessible motifs and RNA folding complexity. Journal of Computational Biology (Special RECOMB 2006 Issue) 14(6), 856–872 (2007)Google Scholar
- 27.Zuker, M.: Prediction of RNA secondary structure by energy minimization. Methods in Molecular Biology 25, 267–294 (1994)Google Scholar
- 38.Wu, T., Wang, J., Liu, C., Zhang, Y., Shi, B., Zhu, X., Zhang, Z., Skogerb, G., Chen, L., Lu, H., Zhao, Y., Chen, R.: NPInter: the noncoding RNAs and protein related biomacromolecules interaction database. Nucleic Acids Res. 34, D150–D152 (2006)Google Scholar
- 39.Benson, D.A., Karsch-Mizrachi, I., Lipman, D.J., Ostell, J., Wheeler, D.L.: GenBank. Nucleic Acids Research 36(Database issue), D25–D30 (2008)Google Scholar