Genome Halving under DCJ Revisited

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.

[1]  B. Birren,et al.  Proof and evolutionary analysis of ancient genome duplication in the yeast Saccharomyces cerevisiae , 2004, Nature.

[2]  Rita Casadio,et al.  Algorithms in Bioinformatics, 5th International Workshop, WABI 2005, Mallorca, Spain, October 3-6, 2005, Proceedings , 2005, WABI.

[3]  Jens Stoye,et al.  A Unifying View of Genome Rearrangements , 2006, WABI.

[4]  David Sankoff,et al.  Genome Halving , 1998, CPM.

[5]  S. Ohno,et al.  Ancient Linkage Groups and Frozen Accidents , 1973, Nature.

[6]  Pavel A. Pevzner,et al.  Whole genome duplications, multi-break rearrangements, and genome halving problem , 2007, SODA '07.

[7]  S. Tanksley,et al.  Comparative linkage maps of the rice and maize genomes. , 1993, Proceedings of the National Academy of Sciences of the United States of America.

[8]  Pavel A. Pevzner,et al.  Whole Genome Duplications and Contracted Breakpoint Graphs , 2007, SIAM J. Comput..

[9]  Richard Friedberg,et al.  Efficient sorting of genomic permutations by translocation, inversion and block interchange , 2005, Bioinform..

[10]  Paramvir S. Dehal,et al.  Two Rounds of Whole Genome Duplication in the Ancestral Vertebrate , 2005, PLoS biology.

[11]  Beat Keller,et al.  Ancestral genome duplication in rice. , 2004, Genome.

[12]  Nadia El-Mabrouk,et al.  Reconstructing an ancestral genome using minimum segments duplications and reversals , 2002, J. Comput. Syst. Sci..

[13]  Pavel A. Pevzner,et al.  Transforming men into mice (polynomial algorithm for genomic distance problem) , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[14]  David Sankoff,et al.  Reconstructing the pre-doubling genome , 1999, RECOMB.

[15]  David Sankoff,et al.  The Reconstruction of Doubled Genomes , 2003, SIAM J. Comput..

[16]  David Sankoff,et al.  Genome Halving with Double Cut and Join. , 2007 .