Colored de Bruijn graphs and the genome halving problem.
Breakpoint graph analysis is a key algorithmic technique in studies of genome rearrangements. However, breakpoint graphs are defined only for genomes without duplicated genes, thus limiting their applications in rearrangement analysis. We discuss a connection between the breakpoint graphs and de Bruijn graphs that leads to a generalization of the notion of breakpoint graph for genomes with duplicated genes. We further use the generalized breakpoint graphs to study the Genome Halving Problem (first introduced and solved by Nadia El-Mabrouk and David Sankoff). The El-Mabrouk-Sankoff algorithm is rather complex, and, in this paper, we present an alternative approach that is based on generalized breakpoint graphs. The generalized breakpoint graphs make the El-Mabrouk-Sankoff result more transparent and promise to be useful in future studies of genome rearrangements.
Alekseyev
Max A
MA
Department of Computer Science and Engineering, University of California at San Diego, La Jolla 92093-0114, USA. maxal@cs.ucsd.edu
Pevzner
Pavel A
PA
D000465:Algorithms; D000818:Animals; D019295:Computational Biology / Q000379:methods*; D004270:DNA, Circular / Q000235:genetics; D019143:Evolution, Molecular; D020440:Gene Duplication; D015321:Gene Rearrangement; D016678:Genome / Q000235:genetics*; D006801:Humans; D008957:Models, Genetic
D004270:DNA, Circular