Abstract
The 2-Interval Pattern problem over its various models and restrictions was proposed by Vialette for RNA secondary structure prediction, and has attracted a lot of attention from the theoretical computer science community in recent years. In the framework of 2-intervals, the preceding-and-crossing model is an especially interesting model for RNA secondary structures with pseudoknots. In this paper, we present a polynomial time approximation scheme for the Weighted 2-Interval Pattern problem over the preceding-and-crossing model. Our algorithm improves the previous best 2-approximation algorithm, and closes this problem in terms of the approximation ratio.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Akutsu, T.: Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots. Discrete Applied Mathematics 104(1-3), 45–62 (2000)
Bar-Yehuda, R., Halldórsson, M.M., Naor, J(S.), Shachnai, H., Shapira, I.: Scheduling split intervals. SIAM Journal on Computing 36(1), 1–15 (2006), Preliminary version In: Proceedings of the 13th annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), pp. 732–741 (2002)
Bereg, S., Kubica, M., Waleń, T., Zhu, B.: RNA multiple structural alignment with longest common subsequences. Journal of Combinatorial Optimization 13(2), 179–188 (2007)
Blin, G., Fertin, G., Vialette, S.: New results for the 2-interval pattern problem. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol. 3109, pp. 311–322. Springer, Heidelberg (2004)
Chen, E., Yang, L., Yuan, H.: Improved algorithms for largest cardinality 2-interval pattern problem. Journal of Combinatorial Optimization, Special Issue on Bioinformatics 13(3), 263–275 (2007)
Crochemore, M., Hermelin, D., Landau, G.M., Vialette, S.: Approximating the 2-interval pattern problem. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 426–437. Springer, Heidelberg (2005)
Crochemore, M., Hermelin, D., Landau, G.M., Rawitz, D., Vialette, S.: Approximating the 2-interval pattern problem. Theoretical Computer Science (to appear)
Ieong, S., Kao, M.-Y., Lam, T.-W., Sung, W.-K., Yiu, S.-M.: Predicting RNA secondary structure with arbitrary pseudoknots by maximizing the number of stacking pairs. Journal of Computational Biology 10(6), 981–995 (2003), (Preliminary version In: Proceedings of the 2nd Annual IEEE International Symposium on Bioinformatics and Bioengineering (BIBE 2001), pp. 183–190 (2001)
Jiang, M.: A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem. Journal of Combinatorial Optimization, Special Issue on Bioinformatics 13(3), 217–221 (2007)
Jiang, M.: Improved approximation algorithms for predicting RNA secondary structures with arbitrary pseudoknots. In: AAIM 2007. Proceedings of the 3rd International Conference on Algorithmic Aspects in Information and Management. LNCS, vol. 4508, pp. 399–410. Springer, Heidelberg (2007)
Lyngsø, R.B.: Complexity of pseudoknot prediction in simple models. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 919–931. Springer, Heidelberg (2004)
Lyngsø, R.B., Pedersen, C.N.S.: RNA pseudoknot prediction in energy-based models. Journal of Computational Biology 7(3/4), 409–427 (2000)
Micali, S., Vazirani, V.V.: An \(O(\sqrt{|V|} |E|)\) algorithm for finding maximum matching in general graphs. In: Proceedings of the 21st Annual Symposium on Foundations of Computer Science (FOCS 1980), pp. 17–27 (1980)
Vialette, S.: On the computational complexity of 2-interval pattern matching problems. Theoretical Computer Science 312, pp. 223–249 (2004), (Preliminary version in Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching (CPM 2002), LNCS 2373, pp. 53–63, 2002)
Yuan, H., Yang, L., Chen, E.: Improved algorithms for largest cardinality 2-interval pattern problem. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 412–421. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jiang, M. (2007). A PTAS for the Weighted 2-Interval Pattern Problem over the Preceding-and-Crossing Model. In: Dress, A., Xu, Y., Zhu, B. (eds) Combinatorial Optimization and Applications. COCOA 2007. Lecture Notes in Computer Science, vol 4616. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73556-4_39
Download citation
DOI: https://doi.org/10.1007/978-3-540-73556-4_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73555-7
Online ISBN: 978-3-540-73556-4
eBook Packages: Computer ScienceComputer Science (R0)