Approximating the 2-interval pattern problem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

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 i...

متن کامل

Approximating the Interval Constrained Coloring Problem

We consider the interval constrained coloring problem, which appears in the interpretation of experimental data in biochemistry. Monitoring hydrogen-deuterium exchange rates via mass spectroscopy experiments is a method used in that field to obtain information about protein tertiary structure. The output of these experiments provides data about the exchange rate of residues in overlapping fragm...

متن کامل

New Results for the 2-Interval Pattern Problem

We present new results concerning the problem of nding a constrained pattern in a set of 2-intervals. Given a set of n 2-intervals D and a model R describing if two disjoint 2-intervals can be in precedence order (<), be allowed to nest (@) and/or be allowed to cross (G), the problem asks to nd a maximum cardinality subset D′ ⊆ D such that any two 2-intervals in D′ agree with R. We improve the ...

متن کامل

Improved Algorithms for Largest Cardinality 2-Interval Pattern Problem

The 2-Interval Pattern problem is to find the largest constrained pattern in a set of 2-intervals. The constrained pattern is a subset of the given 2-intervals such that any pair of them are R-comparable, where model R ⊆ {<, @, () }. The problem stems from the study of general representation of RNA secondary structures. In this paper, we give three improved algorithms for different models. Firs...

متن کامل

Approximating the metric 2-Peripatetic Salesman Problem

This paper deals with the 2-Peripatetic Salesman Problem for the case where costs respect the triangle inequality. The aim is to determine 2 edge disjoint Hamiltonian cycles of minimum total cost on a graph. We first present a straightforward 9/4 approximation algorithm based on the well known Christofides algorithm for the travelling salesman problem. Then we propose a 2(n−1)/n-approximation p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2008

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2008.01.007