Approximating the 2-Interval Pattern Problem
We address the problem of approximating the 2-Interval Pattern problem over its various models and restrictions. This problem, which is motivated by RNA secondary structure prediction, asks to find a maximum cardinality subset of a 2-interval set with respect to some prespecified model. For each such model, we give varying approximation quality depending on the different possible restrictions imposed on the input 2-interval set.
KeywordsApproximation Algorithm Pairwise Disjoint Interval Graph Schematic Description Discrete Apply Mathematic
Unable to display preview. Download preview PDF.
- 2.Bar-Yehuda, R., Halldorsson, M.M., Naor, J., Shachnai, H., Shapira, I.: Scheduling spit intervals. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), pp. 732–741 (2002)Google Scholar
- 8.Ieong, S., Kao, M.Y., Lam, T.W., Sung, W.K., Yiu, S.M.: Predicting RNA secondary structures with arbitrary pseudoknots by maximizing the number of stacking pairs. In: Proceedings of the 2nd Symposium on Bioinformatics and Bioengineering (BIBE 2002), pp. 183–190 (2002)Google Scholar
- 10.McKee, T.A., McMorris, F.R.: Topics in intersection graph theory. SIAM monographs on discrete mathematics and applications (1999)Google Scholar