Computing the Summed Adjacency Disruption Number between Two Genomes with Duplicate Genes Using Pseudo-Boolean Optimization
The increasing number of fully sequenced genomes has led to the study of genome rearrangements. Several approaches have been proposed to solve this problem, all of them being either too complex to be solved efficiently or too simple to be applied to genomes of complex organisms. The latest challenge has been to overcome the problem of having genomes with duplicate genes. This led to the definition of matching models and similarity measures. The idea is to find a matching between genes in two genomes, in order to disambiguate the data of duplicate genes and calculate a similarity measure. The problem becomes that of finding a matching that best preserves the order of genes in two genomes, where gene order is evaluated by a chosen similarity measure. This paper presents a new pseudo-Boolean encoding for computing the exact summed adjacency disruption number for two genomes with duplicate genes. Experimental results on a γ-Proteobacteria data set illustrate the approach.
KeywordsGene Family Genome Rearrangement Maximum Match Maximum Model Exemplar Model
Unable to display preview. Download preview PDF.
- 3.Bafna, V., Pevzner, P.A.: Sorting by reversals: Genome rearrangements in plant organneles and evolutionary history of x chromosome. Molecular Biology and Evolution 12(2), 239–246 (1995)Google Scholar
- 5.Barth, P.: A Davis-Putnam enumeration algorithm for linear pseudo-Boolean optimization. Technical Report MPI-I-95-2-003, Max Plank Institute for CS (1995)Google Scholar
- 8.Caprara, A., Lancia, G., Ng, S.K.: A column-generation based branch-and-bound algorithm for sorting by reversals. In: Mathematical Support for Molecular Biology. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 47, pp. 213–226 (1999)Google Scholar
- 9.Delgado, J.: Pseudo-boolean approaches to comparative genomics. Master’s thesis, Instituto Superior Técnico, Technical University of Lisbon, Portugal (June 2009)Google Scholar
- 10.Eén, N., Sörensson, N.: Translating pseudo-boolean constraints into sat. Journal on Satisfiability, Boolean Modeling and Computation 2, 1–26 (2006)Google Scholar
- 11.Kececioglu, J., Ravi, R.: Of mice and men: Evolutionary distances between genomes under translocations. In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 604–613 (1995)Google Scholar
- 18.Sankoff, D., Leduc, G., Antoine, N., Paquin, B., Lang, B.F., Cedergren, R.: Gene order comparisons for phylogenetic inference: evolution of the mitochondrial genome. Proceedings of the National Academy of Sciences of the United States of America 89(14), 6575–6579 (1992)CrossRefPubMedPubMedCentralGoogle Scholar