Tractability results for the Double-Cut-and-Join circular median problem

Details Tractability results for the Double-Cut-and-Join circular median problem Tractability results for the Double-Cut-and-Join circular median problem

2011-11-24

arxiv.org/abs/1111.5872v1

Computer Science

Discrete Mathematics

12 pages, 6 figures, submitted

Scientific paper

The circular median problem in the Double-Cut-and-Join (DCJ) distance asks to find, for three given genomes, a fourth circular genome that minimizes the sum of the mutual distances with the three other ones. This problem has been shown to be NP-complete. We show here that, if the number of vertices of degree 3 in the breakpoint graph of the three input genomes is fixed, then the problem is tractable

Affiliated with

Also associated with

No associations

Rating

Tractability results for the Double-Cut-and-Join circular median 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 Tractability results for the Double-Cut-and-Join circular median problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tractability results for the Double-Cut-and-Join circular median problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-173389