Genome Halving under DCJ revisited

Abstract

The Genome Halving Problem is the following: Given a rearranged duplicated genome, find a perfectly duplicated genome such that the rearrangement distance between these genomes is minimal with respect to a particular model of genome rearrangement. Recently, Warren and Sankoff studied this problem under the general DCJ model where the pre-duplicated genome contains both, linear and circular chromosomes. In this paper, we revisit the Genome Halving Problem for the DCJ distance and we propose a genome model such that constraints for linear genomes, as well as the ones for circular genomes are taken into account. Moreover, we correct an error in the original paper. © 2008 Springer-Verlag Berlin Heidelberg.