Approximating the 2-interval pattern problem

Maxime Crochemore, Danny Hermelin, Gad M. Landau, Stéphane Vialette

Research output: Contribution to journalConference articlepeer-review

22 Scopus citations


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.

Original languageEnglish
Pages (from-to)426-437
Number of pages12
JournalLecture Notes in Computer Science
StatePublished - 1 Jan 2005
Externally publishedYes
Event13th Annual European Symposium on Algorithms, ESA 2005 - Palma de Mallorca, Spain
Duration: 3 Oct 20056 Oct 2005

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Approximating the 2-interval pattern problem'. Together they form a unique fingerprint.

Cite this