Tractability results for the Double-Cut-and-Join circular median problem
Discrete Mathematics
2011-11-28 v1 Data Structures and Algorithms
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
Keywords
Cite
@article{arxiv.1111.5872,
title = {Tractability results for the Double-Cut-and-Join circular median problem},
author = {Ahmad Mahmoody-Ghaidary and Cedric Chauve and Ladislav Stacho},
journal= {arXiv preprint arXiv:1111.5872},
year = {2011}
}
Comments
12 pages, 6 figures, submitted