Abstract
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 language | English |
---|---|
Pages (from-to) | 426-437 |
Number of pages | 12 |
Journal | Lecture Notes in Computer Science |
Volume | 3669 |
DOIs | |
State | Published - 1 Jan 2005 |
Externally published | Yes |
Event | 13th Annual European Symposium on Algorithms, ESA 2005 - Palma de Mallorca, Spain Duration: 3 Oct 2005 → 6 Oct 2005 |
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science