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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Crochemore, M., Hermelin, D., Landau, G. M., & Vialette, S. (2005). Approximating the 2-interval pattern problem. In Lecture Notes in Computer Science (Vol. 3669, pp. 426–437). Springer Verlag. https://doi.org/10.1007/11561071_39
Mendeley helps you to discover research relevant for your work.