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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ahn, S., Tanksley, S.D.: Comparative Linkage Maps of Rice and Maize Genomes. Proc. Natl. Acad. Sci. 90(17), 7980–7984 (1993)
Alekseyev, M., Pevzner, P.: Whole Genome Duplications and Contracted Breakpoint Graphs. SIAM J. Comput. 36(6), 1748–1763 (2007)
Alekseyev, M., Pevzner, P.: Whole Genome Duplications, Multi-break Rearrangements, and Genome Halving Problem. In: Proceedings of SODA 2007, pp. 665–679 (2007)
Bergeron, A., Mixtacki, J., Stoye, J.: A Unifying View of Genome Rearrangements. In: Bücher, P., Moret, B.M.E. (eds.) WABI 2006. LNCS (LNBI), vol. 4175, pp. 163–173. Springer, Heidelberg (2006)
Dehal, P., Boore, J.L.: Two Rounds of Whole Genome Duplication in the Ancestral Vertebrate. PLoS Biology 3(10), 314 (2003)
El-Mabrouk, N.: Reconstructing an Ancestral Genome Using Minimum Segments Duplications and Reversals. J. Comput. Syst. Sci. 65(3), 442–464 (2002)
El-Mabrouk, N., Bryant, D., Sankoff, D.: Reconstructing the Pre-doubling Genome. In: Proceedings of RECOMB 1999, pp. 154–163 (1999)
El-Mabrouk, N., Nadeau, J., Sankoff, D.: Genome Halving. In: Farach-Colton, M. (ed.) CPM 1998. LNCS, vol. 1448, pp. 235–250. Springer, Heidelberg (1998)
El-Mabrouk, N., Sankoff, D.: The Reconstruction of Doubled Genomes. SIAM J. Comput. 32(3), 754–792 (2003)
Guyot, R., Keller, B.: Ancestral Genome Duplication in Rice. Genome 47, 610–614 (2004)
Hannenhalli, S., Pevzner, P.: Transforming Men into Mice (polynomial Algorithm for Genomic Distance Problem). In: Proceedings of FOCS 1995, pp. 581–592. IEEE Press, Los Alamitos (1995)
Kellis, M., Birren, B.W., Lander, E.S.: Proof and Evolutionary Analysis of Ancient Genome Duplication in the Yeast Saccharomyces Cerevisiae. Nature 428(6983), 617–624 (2004)
Ohno, S.: Ancient Linkage Group and Frozen Accidents. Nature 244, 259–262 (1973)
Warren, R., Sankoff, D.: Genome Halving with Double Cut and Join. In: Proceedings of APBC 2008, Series on Advances in Bioinformatics and Computational Biology, vol. 6 (2008)
Yancopoulos, S., Attie, O., Friedberg, R.: Efficient Sorting of Genomic Permutations by Translocation, Inversion and Block Interchange. Bioinformatics 21(16), 3340–3346 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mixtacki, J. (2008). Genome Halving under DCJ Revisited. In: Hu, X., Wang, J. (eds) Computing and Combinatorics. COCOON 2008. Lecture Notes in Computer Science, vol 5092. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69733-6_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-69733-6_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69732-9
Online ISBN: 978-3-540-69733-6
eBook Packages: Computer ScienceComputer Science (R0)