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

Ahmad Mahmoody-Ghaidary; Cedric Chauve; Ladislav Stacho

arxiv: 1111.5872 · v1 · pith:6CALNFQJnew · submitted 2011-11-24 · 💻 cs.DM · cs.DS

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

Ahmad Mahmoody-Ghaidary , Cedric Chauve , Ladislav Stacho This is my paper

classification 💻 cs.DM cs.DS

keywords problemcircularthreedouble-cut-and-joingenomesmedianasksbeen

0 comments

read the original abstract

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

This paper has not been read by Pith yet.

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

discussion (0)