Approximating the 2-Interval Pattern Problem

13 years 10 months ago

Download cs.haifa.ac.il

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 ﬁnd a maximum cardinality subset of a 2-interval set with respect to some prespeciﬁed model. For each such model, we give varying approximation quality depending on the diﬀerent possible restrictions imposed on the input 2-interval set.

Maxime Crochemore, Danny Hermelin, Gad M. Landau,

Real-time Traffic

2-interval Pattern Problem | 2-interval Set | ESA 2005 | Maximum Cardinality Subset |

claim paper

» Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary P...

» Improved Algorithms for Largest Cardinality 2Interval Pattern Problem

» A PTAS for the Weighted 2Interval Pattern Problem over the PrecedingandCrossing Model

» New Results for the 2Interval Pattern Problem

» A New Algorithm for Training SVMs Using Approximate Minimal Enclosing Balls

» Finding Approximate Repeating Patterns from Sequence Data

» Pattern matching in pseudo realtime

» Approximation Algorithms for Biclustering Problems

Post Info
More Details (n/a)

Added	27 Jun 2010
Updated	27 Jun 2010
Type	Conference
Year	2005
Where	ESA
Authors	Maxime Crochemore, Danny Hermelin, Gad M. Landau, Stéphane Vialette

Comments (0)

Sciweavers

Approximating the 2-Interval Pattern Problem

2-interval Pattern Problem | 2-interval Set | ESA 2005 | Maximum Cardinality Subset |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers