Hardness Results for the Gapped Consecutive-Ones Property

Details Hardness Results for the Gapped Consecutive-Ones Property Hardness Results for the Gapped Consecutive-Ones Property

2009-12-02

arxiv.org/abs/0912.0309v2

Computer Science

Computational Complexity

Scientific paper

Motivated by problems of comparative genomics and paleogenomics, in [Chauve et al., 2009], the authors introduced the Gapped Consecutive-Ones Property Problem (k,delta)-C1P: given a binary matrix M and two integers k and delta, can the columns of M be permuted such that each row contains at most k blocks of ones and no two consecutive blocks of ones are separated by a gap of more than delta zeros. The classical C1P problem, which is known to be polynomial is equivalent to the (1,0)-C1P problem. They showed that the (2,delta)-C1P Problem is NP-complete for all delta >= 2 and that the (3,1)-C1P problem is NP-complete. They also conjectured that the (k,delta)-C1P Problem is NP-complete for k >= 2, delta >= 1 and (k,delta) =/= (2,1). Here, we prove that this conjecture is true. The only remaining case is the (2,1)-C1P Problem, which could be polynomial-time solvable.

Affiliated with

Also associated with

No associations

Rating

Hardness Results for the Gapped Consecutive-Ones Property 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 Hardness Results for the Gapped Consecutive-Ones Property, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hardness Results for the Gapped Consecutive-Ones Property will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-508193