Genome halving problem revisited

Authors:
Max A. Alekseyev;Pavel A. Pevzner
Affiliations:
Department of Computer Science and Engineering, University of California at San Diego, La Jolla, CA;Department of Computer Science and Engineering, University of California at San Diego, La Jolla, CA
Venue:
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Year:
2004

Citing 7
Cited 0

Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Reconstructing the pre-doubling genome

RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals

SIAM Journal on Computing
Genome Rearrangements and Sorting by Reversals

SIAM Journal on Computing
A Very Elementary Presentation of the Hannenhalli-Pevzner Theory

CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Genome Halving

CPM '98 Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching
The Reconstruction of Doubled Genomes

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.