Approximation Algorithms for the Maximum Multiple RNA Interaction Problem
RNA interactions are fundamental in many cellular processes, which can involve two or more RNA molecules. Multiple RNA interactions are also believed to be much more complex than pairwise interactions. Recently, multiple RNA interaction prediction has been formulated as a maximization problem. Here we extensively examine this optimization problem under several biologically meaningful interaction models. We present a polynomial time algorithm for the problem when the order of interacting RNAs is known and pseudoknot interactions are allowed; for the general problem without an assumed RNA order, we prove the NP-hardness for both variants (allowing and disallowing pseudoknot interactions), and present a constant ratio approximation algorithm for each of them.
KeywordsRNA interaction maximum weight b-matching acyclic 2-matching approximation algorithm worst case performance ratio
Unable to display preview. Download preview PDF.
- 6.Diestel, R.: Graph Theory. Graduate Texts in Mathematics. Springer (2005)Google Scholar
- 7.Harary, F.: Graph Theory. Addison-Wesley (1969)Google Scholar
- 15.Pervouchine, D.D.: Iris: intermolecular RNA interaction search. Genome Informatics 15, 92–101 (2004)Google Scholar
- 18.Tong, W., Chen, Z.-Z., Wang, L., Xu, Y., Xu, J., Goebel, R., Lin, G.: An approximation algorithm for the Bandpass-2 problem. ArXiv e-print 1307.7089 (July 2013)Google Scholar