P. Alimonti and V. Kann, Hardness of approximating problems on cubic graphs, LNCS, vol.1203, pp.288-298, 1997.
DOI : 10.1007/3-540-62592-5_80

X. Chen and Y. Cui, An Approximation Algorithm for the Minimum Breakpoint Linearization Problem, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.6, issue.3, pp.401-409, 2009.
DOI : 10.1109/TCBB.2009.3

G. Even, J. Naor, B. Schieber, and M. Sudan, Approximating minimum feedback sets and multi-cuts in directed graphs, Lecture Notes in Computer Science, vol.920, pp.14-28, 1995.
DOI : 10.1007/3-540-59408-6_38
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.15.8967

Z. Fu and T. Jiang, COMPUTING THE BREAKPOINT DISTANCE BETWEEN PARTIALLY ORDERED GENOMES, Journal of Bioinformatics and Computational Biology, vol.05, issue.05, pp.1087-1101, 2007.
DOI : 10.1142/S0219720007003107

C. Papadimitriou and M. Yannakakis, Optimization, approximation, and complexity classes, Journal of Computer and System Sciences, vol.43, issue.3, pp.425-440, 1991.
DOI : 10.1016/0022-0000(91)90023-X
URL : http://doi.org/10.1016/0022-0000(91)90023-x

I. V. Yap, D. Schneider, J. Kleinberg, D. Matthews, S. Cartinhourb et al., A graph-theoretic approach to comparing and integrating genetic, physical and sequence-based maps, Genetics, vol.165, issue.4, pp.2235-2247, 2003.

C. Zheng, A. Lenert, and D. Sankoff, Reversal distance for partially ordered genomes, ISMB (Supplement of Bioinformatics), pp.502-508, 2005.
DOI : 10.1093/bioinformatics/bti1037

C. Zheng and D. Sankoff, Genome Rearrangements with Partially Ordered Chromosomes, Lecture Notes in Computer Science, vol.3595, pp.52-62, 2005.
DOI : 10.1007/11533719_8