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.

• Type: Conference
• Year: 2005
• Where: ESA
• Authors: Maxime Crochemore, Danny Hermelin, Gad M. Landau, Stéphane Vialette
• Keywords: 2-interval Pattern Problem, 2-interval Set, ESA 2005, Maximum Cardinality Subset