P. Barth, A Davis-Putnam based enumeration algorithm for linear pseudo-Boolean optimization, 2005.

G. Blin, C. Chauve, and G. Fertin, The breakpoint distance for signed sequences, Proc. 1st Algorithms and Computational Methods for Biochemical and Evolutionary Networks (CompBioNets), pp.3-16, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00620356

G. Blin, C. Chauve, and G. Fertin, Genes Order and Phylogenetic Reconstruction: Application to ??-Proteobacteria, Proc. 3rd RECOMB Comparative Genomics Satellite Workshop, pp.11-20, 2005.
DOI : 10.1007/11554714_2
URL : https://hal.archives-ouvertes.fr/hal-00620362

G. Blin and R. Rizzi, Conserved Interval Distance Computation Between Non-trivial Genomes, Proc. 11th Annual Int. Conference on Computing and Combinatorics (COCOON), pp.22-31, 2005.
DOI : 10.1007/11533719_5
URL : https://hal.archives-ouvertes.fr/hal-00620353

G. Bourque, Y. Yacef, and N. El-mabrouk, Maximizing Synteny Blocks to Identify Ancestral Homologs, Proc. 3rd RECOMB Comparative Genomics Satellite Workshop, pp.21-35, 2005.
DOI : 10.1007/11554714_3

D. Bryant, The complexity of calculating exemplar distances In Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment, and the Evolution of Gene Families, pp.207-212, 2000.

D. Chai and A. Kuehlmann, A fast pseudo-boolean constraint solver, Proc. 40th ACM IEEE conference on Design automation, pp.830-835, 2003.

C. Chauve, G. Fertin, R. Rizzi, and S. Vialette, Genomes Containing Duplicates Are Hard to Compare, Proc Int. Workshop on Bioinformatics Research and Applications (IWBRA), pp.783-790, 2006.
DOI : 10.1007/11758525_105
URL : https://hal.archives-ouvertes.fr/hal-00418260

X. Chen, J. Zheng, Z. Fu, P. Nan, Y. Zhong et al., COMPUTING THE ASSIGNMENT OF ORTHOLOGOUS GENES VIA GENOME REARRANGEMENT, Proceedings of the 3rd Asia-Pacific Bioinformatics Conference, pp.302-315, 2005.
DOI : 10.1142/9781860947322_0037

N. Eén and N. Sörensson, Translating pseudo-boolean constraints into SAT, Journal on Satisfiability Boolean Modeling and Computation, vol.2, pp.1-26, 2006.

E. Lerat, V. Daubin, and N. A. Moran, From gene tree to organismal phylogeny in prokaryotes: the case of ?-proteobacteria, PLoS Biology, vol.1, issue.1, pp.101-109, 2003.

D. Sankoff, Genome rearrangement with gene families, Bioinformatics, vol.15, issue.11, pp.909-917, 1999.
DOI : 10.1093/bioinformatics/15.11.909

D. Sankoff and L. Haque, Power Boosts for Cluster Tests, Proc. 3rd RECOMB Comparative Genomics Satellite Workshop, pp.11-20, 2005.
DOI : 10.1007/11554714_11

A. Schrijver, Theory of Linear and Integer Programming, 1998.

H. M. Sheini and K. A. Sakallah, Pueblo: A hybrid pseudo-boolean SAT solver, Journal on Satisfiability Boolean Modeling and Computation, vol.2, pp.165-189, 2006.