1. Blin, G., Chauve, C., Fertin, G.: The breakpoint distance for signed sequences. In: 1st Int. Conference on Algorithms and Computational Methods for Biochemical and Evolutionary Networks, CompBioNets 2004. Texts in Algorithms, vol. 3, pp. 3–16. KCL Publications (2004)
2. Lecture Notes in Computer Science;G. Blin,2005
3. Bryant, D.: The complexity of calculating exemplar distances. In: Sankoff, D., Nadeau, J. (eds.) Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment, and the Evolution of Gene Families, pp. 207–212. Kluwer Acad. Pub., Dordrecht (2000)
4. Chen, X., Zheng, J., Fu, Z., Nan, P., Zhong, Y., Lonardi, S., Jiang, T.: Assignment of orthologous genes via genome rearrangement. IEEE/ACM Trans. on Comp. Biology and Bioinformatics 2(4), 302–315 (2005)
5. Garey, M.R., Johnson, D.S.: Computers and Intractability: a guide to the theory of NP-completeness. W.H. Freeman, San Franciso (1979)