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

A. Bergeron, C. Chauve, F. De-montgolfier, and M. Raffinot, Permutations, with Applications to Modular Decomposition of Graphs, Proc. 5th Workshop on Algorithms in Bioinformatics (WABI), pp.779-790, 2005.
DOI : 10.1137/060651331
URL : https://hal.archives-ouvertes.fr/hal-00159580

G. Blin, C. Chauve, and G. Fertin, The breakpoint distance for signed sequences, 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 intervals distance computation between nontrivial genomes, Proc. 11th Annual Int. Conference on Computing and Combinatorics (COCOON), pp.22-31, 2005.

G. Bourque, Y. Yacef, and N. 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, Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, 2000.
DOI : 10.1007/978-94-011-4309-7_19

N. El-mabrouk, Reconstructing an ancestral genome using minimum segments duplications and reversals, Journal of Computer and System Sciences, vol.65, issue.3, pp.442-464, 2002.
DOI : 10.1016/S0022-0000(02)00003-X
URL : http://doi.org/10.1016/s0022-0000(02)00003-x

Z. Fu, X. Chen, V. Vacic, P. Nan, Y. Zhong et al., A Parsimony Approach to Genome-Wide Ortholog Assignment, Proc. 10th Annual International Conference on Research in Computational Molecular Biology (RECOMB), volume 3909 of LNBI, pp.578-594, 2006.
DOI : 10.1007/11732990_47
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.91.128

A. Goldstein, P. Kolman, and J. Zheng, Minimum Common String Partition Problem: Hardness and Approximations, Proc. 15th International Symposium on Algorithms and Computation (ISAAC), pp.484-495, 2004.
DOI : 10.1007/978-3-540-30551-4_43
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.296.1220

P. Kolman and T. Wale´nwale´n, Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set, Proc. 4th Workshop on Approximation and Online Algorithms (WAOA), pp.281-291, 2006.
DOI : 10.1007/11970125_22
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.73.3192

P. Kolman and T. Wale´nwale´n, Approximating reversal distance for strings with bounded number of duplicates, Discrete Applied Mathematics, vol.155, issue.3, pp.327-336, 2007.
DOI : 10.1016/j.dam.2006.05.011

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

M. Marron, K. Swenson, and B. Moret, Genomic Distances under Deletions and Insertions, Theoretical Computer Science, vol.325, issue.3, pp.347-360, 2004.
DOI : 10.1016/j.tcs.2004.02.039
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.8269

D. Sankoff, Genome rearrangement with gene families, Bioinformatics, vol.15, issue.11, pp.909-917, 1999.
DOI : 10.1093/bioinformatics/15.11.909
URL : http://bioinformatics.oxfordjournals.org/cgi/content/short/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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.664.9144

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

H. Sheini and K. Sakallah, Pueblo: A hybrid pseudo-boolean SAT solver, Journal on Satisfiability Boolean Modeling and Computation, vol.2, pp.165-189, 2006.
DOI : 10.1109/date.2005.246
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.88.3692

K. Swenson, M. Marron, J. Earnest-deyoung, and B. Moret, Approximating the true evolutionary distance between two genomes, Proc. 7th Workshop on Algorithms Engineering and Experiments and Second Workshop on Analytic Algorithmics and Combinatorics, pp.121-129, 2005.
DOI : 10.1145/1227161.1402297
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.154.556

K. Swenson, N. Pattengale, and B. Moret, A Framework for Orthology Assignment from Gene Rearrangement Data, Proc. 3rd RECOMB Workshop on Comparative Genomics (RECOMB-CG), volume 3678 of LNBI, pp.153-166, 2005.
DOI : 10.1007/11554714_14
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.216.9270

N. C. Thach, Algorithms for calculating exemplar distances. Honours Year Project Report, 2005.

T. Uno and M. Yagiura, Fast Algorithms to Enumerate All Common Intervals of Two Permutations, Algorithmica, vol.26, issue.2, pp.290-309, 2000.
DOI : 10.1007/s004539910014