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 (RECOMB-CG'05), volume 3678 of LNBI, 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.

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

G. A. Watterson, W. J. Ewens, T. E. Hall, and A. Morgan, The chromosome inversion problem, Journal of Theoretical Biology, vol.99, issue.1, pp.1-7, 1982.
DOI : 10.1016/0022-5193(82)90384-8