Genome Halving Problem Revisited
The Genome Halving Problem is motivated by the whole genome duplication events in molecular evolution that double the gene content of a genome and result in a perfect duplicated genome thatcontains two identical copies of each chromosome. The genome then becomes a subject to rearrangements resulting in some rearranged duplicated genome. The Genome Halving Problem (first introduced and solved by Nadia El-Mabrouk and David Sankoff) is to reconstruct the ancestral pre-duplicated genome from the rearranged duplicated genome. The El-Mabrouk–Sankoff algorithm is rather complex and in this paper we present a simpler algorithm that is based on a generalization of the notion of the breakpoint graph to the case of duplicated genomes. This generalization makes the El-Mabrouk–Sankoff result more transparent and promises to be useful in future studies of genome duplications.
KeywordsGenome Duplication Genome Duplication Event Cycle Decomposition Signed Permutation Black Edge
Unable to display preview. Download preview PDF.
- 7.El-Mabrouk, N., Sankoff, D.: “On the reconstruction of ancient doubled circular genomes using minimum reversal”. Genome Informatics 10, 83–93 (1999)Google Scholar
- 8.El-Mabrouk, N., Bryant, B., Sankoff, D.: Reconstructing the pre-doubling genome. In: Proceedings of the Third Annual International Conference on Computational Molecular Biology RECOMB 1999, pp. 154–163 (1999)Google Scholar
- 10.Hannenhalli, S., Pevzner, P.: Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). In: Proceedings of the Twenty- Seventh Annual ACM Symposium on Theory of Computing (1995), pp. 178–189. ACM Press, New York (1995); Journal of the ACM 46, 1–27 (1999) CrossRefGoogle Scholar