A pseudo-boolean framework for computing rearrangement distances between genomes with duplicates

Journal of Computational Biology

Volumn 14, Issue 4, 2007, Pages 379-393

  Angibaud, Sébastien ^a   Fertin, Guillaume ^a   Rusu, Irena ^a   Vialette, Stéphane ^b  

^a UNIVERSITÉ DE NANTES   (France)

^b UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

Author keywords

Common intervals; Duplication; Genome rearrangement; Heuristic; Pseudo boolean programming

Indexed keywords

ACCURACY; ALGORITHM; BACTERIAL GENOME; COMPARATIVE GENE MAPPING; CONCEPTUAL FRAMEWORK; CONFERENCE PAPER; GAMMAPROTEOBACTERIA; GENE DUPLICATION; GENE REARRANGEMENT; GENETIC DATABASE; GENOME ANALYSIS; INFORMATION SCIENCE; MATHEMATICAL COMPUTING; NONHUMAN; PRIORITY JOURNAL;

GAMMAPROTEOBACTERIA;

EID: 34250375663     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2007.A001     Document Type: Conference Paper

References (31)

1. Barth, P. 2005. A Davis-Putnam based enumeration algorithm for linear pseudo-boolean optimization [Technical Report MPI-I-95-2-003]. Max Planck Institut Informatik.
2. Bergeron, A., Chauve, C., de Montgolfier, F., et al. 2005. Computing common intervals of K permutations, with applications to modular decomposition of graphs. Lect. Notes. Comput. Sci. 3669, 779-790.
3. Blin, G., Chauve, C., and Fertin, G. 2004. The breakpoint distance for signed sequences. Proc. 1st Algorithms Comput. Methods Biochem. Evol. Networks (CompBioNets), 3-16.
4. Blin, G., Chauve, C., and Fertin, G. 2005. Genes order and phylogenetic reconstruction: application to γ-proteobacteria. Lect. Notes. Bioinform. 3678, 11-20.
5. Blin, G., and Rizzi, R. 2005. Conserved intervals distance computation between non-trivial genomes. Lect. Notes. Comput. Sci. 3595, 22-31.
6. Bourque, G., Yacef, Y., and El-Mabrouk, N. 2005. Maximizing synteny blocks to identify ancestral homologs. Lect. Notes. Bioinform. 3678, 21-35.
7. Bryant, D. 2000. The complexity of calculating exemplar distances, 207-212. In: Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment, and the Evolution of Gene Families. Kluwer, Amsterdam.
8. Chai, D., and Kuehlmann, A. 2003. A fast pseudo-boolean constraint solver. Proc. 40th ACM IEEE Conf. Design Automation, 830-835.
9. Chauve, C., Fertin, G., Rizzi, R., et al. 2006. Genomes containing duplicates are hard to compare. Lect. Notes. Comput. Sci. 3992, 783-790.
10. Chen, X., Zheng, J., Fu, Z., et al., 2005. Assignment of orthologous genes via genome rearrangement. IEEE/ACM Trans. Comput. Biol. Bioinform. 2, 302-315.
11. Chen, Z., Fowler, R., Fu, B., et al. 2006a. Lower bounds on the approximation of the exemplar conserved interval distance problem of genomes. Lect. Notes. Comput. Sci. 4112, 245-254.
12. Chen, Z., Fu, B., and Zhu, B. 2006b. The approximability of the exemplar breakpoint distance problem. Lect. Notes. Comput. Sci. 3328, 291-302.
13. Chrobak, M., Kolman, P., and Sgall, J. 2005. The greedy algorithm for the minimum common string partition problem. ACM Trans. Algorithms 1, 350-366.
14. Eén, N., and Sörensson, N. 2006. Translating pseudo-boolean constraints into SAT. J. Satisfiability Boolean Modeling Comput. 2, 1-26.
15. El-Mabrouk, N. 2001. Sorting signed permutations by reversals and insertions/deletions of contiguous segments. J. Discrete Algorithms 1, 105-122.
16. El-Mabrouk, N. 2002. Reconstructing an ancestral genome using minimum segments duplications and reversals. J. Comput. Syst. Sci. 65, 442-464.
17. Fu, Z., Chen, X., Vacic, V., et al. 2006. A parsimony approach to genome-wide ortholog assignment. Lect. Notes. Bioinform. 3909, 578-594.
18. Goldstein, A., Kolman, P., and Zheng, J. 2004. Minimum common string partition problem: hardness and approximations. Lect. Notes. Comput. Sci. 3341, 484-495.
19. Kolman, P. and Waleń, T. 2006. Reversal distance for strings with duplicates: linear time approximation using hitting set. Lect. Notes. Comput. Sci. 4368, 281-291.
20. Kolman, P. and Waleń, T. 2007. Approximating reversal distance for strings with bounded number of duplicates. Discrete Appl. Math. 155, 327-336.
21. Landau, G., Parida, L., and Weimann, O. 2005. Gene proximity analysis across whole genomes via PQ trees. J. Comput. Biol. 12, 1289-1306.
22. Lerat, E., Daubin, V., and Moran, N. 2003. From gene tree to organismal phylogeny in prokaryotes: The case of γ-proteobacteria. PLoS Biol. 1, 101-109.
23. Marron, M., Swenson, K., and Moret, B. 2004. Genomic distances under deletions and insertions. Theoret. Comput. Sci. 325, 347-360.
24. Sankoff, D. 1999. Genome rearrangement with gene families. Bioinformatics 15, 909-917.
25. Sankoff, D., and Haque, L. 2005. Power boosts for cluster tests. Lect. Notes. Bioinform. 3678, 11-20.
26. Schrijver, A. 1998. Theory of Linear and Integer Programming. John Wiley and Sons, New York.
27. Sheini, H., and Sakallah, K. 2006. Pueblo: a hybrid pseudo-boolean SAT solver. J. Satisfiability Boolean Modeling Comput. 2, 165-189.
28. Swenson, K., Marron, M., Earnest-DeYoung, J., et al. (2005a). Approximating the true evolutionary distance between two genomes. Proc. 7th Workshop Algorithms Eng. Experiments Second Workshop Analytic Algorithmics Combinatorics (ALENEX), 121-129.
29. Swenson, K., Pattengale, N., and Moret, B. 2005b. A framework for orthology assignment from gene rearrangement data. Lect. Notes. Bioinform. 3678, 153-166.
30. Thach, N.C. 2005. Algorithms for calculating exemplar distances. [Honours Year Project Report]. National University of Singapore.
31. Uno, T., and Yagiura, M. 2000. Fast algorithms to enumerate all common intervals of two permutations. Algorithmica 26, 290-309.