A Matrix Algorithm for RNA Secondary Structure Prediction
In this paper we propose a novel high-performance algorithm, referred to as MARSs (Matrix Algorithm for RNA Secondary Structure Prediction), for predicting RNA Secondary Structures with or without pseudoknots. The algorithm is capable of operating in both serial and parallel modes. The algorithm will take complete advantage of the explicit hardware parallelism increasingly available in todayś multi-core processors resulting in execution speedups. Unlike Dynamic Programming based algorithms, MARSs is non-recursive by design and therefore eliminates some of the disadvantages of Dynamic Programming based algorithms. We performed a large-scale experiment on a multi-core hardware using real sequences with verified structures. We detail and discuss the results from these experiments using metrics such as performance gains, run-times and prediction accuracy. This is one of the first attempts of its kind to provide a complete flexibility in evolving a RNA secondary structure with or without pseudoknots using a matrix-based approach.
KeywordsRNA secondary structure prediction parallel computing high performance computing multi-core
- 3.Lyngs, R., Zuker, M., Pedersen, C.: An Improved Algorithm for RNA Secondary Structure Prediction. Tech-report BRICS RS-99-15 (1999)Google Scholar
- 6.Dirks, R., Pierce, N.A.: A partition function algorithm for nucleic acid secondary structure including pseudoknots. Journal of Computational Chemistry 2003 24, 1664–1677 (2003)Google Scholar
- 8.Deogun, J., Donts, R., Komina, O., Ma, F.: RNA Secondary Structure Prediction with Simple Pseudoknots. In: APBC 2004, pp. 239–246 (2004)Google Scholar
- 13.Fu, X.Z., Wang, H., Harrison, W., Harrison, R.: RNA Pseudoknot Prediction Using Term Rewriting. International Journal of Data Mining and Bioinformatics (2006)Google Scholar