The interval ordering problem

Details The interval ordering problem The interval ordering problem

2011-12-02

arxiv.org/abs/1112.0534v1

Computer Science

Data Structures and Algorithms

Scientific paper

For a given set of intervals on the real line, we consider the problem of ordering the intervals with the goal of minimizing an objective function that depends on the exposed interval pieces (that is, the pieces that are not covered by earlier intervals in the ordering). This problem is motivated by an application in molecular biology that concerns the determination of the structure of the backbone of a protein. We present polynomial-time algorithms for several natural special cases of the problem that cover the situation where the interval boundaries are agreeably ordered and the situation where the interval set is laminar. Also the bottleneck variant of the problem is shown to be solvable in polynomial time. Finally we prove that the general problem is NP-hard, and that the existence of a constant-factor-approximation algorithm is unlikely.

Affiliated with

Also associated with

No associations

Rating

The interval ordering problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The interval ordering problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The interval ordering problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-141122