1. Lecture Notes in Computer Science;Y. Ajana,2002
2. Bader, D.A., Moret, B.M.E., Yan, M.: A linear-time algorithm for computing inversion distances between signed permutations with an experimental study. J. Comput. Biol. 8(5), 483–491 (2001)
3. Berard, S., et al.: Perfect sorting by reversals is not always difficult. To appear in IEEE transactions on bioinformatics and computational biology (2006)
4. Bergeron, A., et al.: On the properties of sequences of reversals that sort a signed permutation. In: JOBIM 2002, pp. 99–108 (2002)
5. Bergeron, A., Mixtacki, J., Stoye, J.: The inversion distance problem. In: Gascuel, O. (ed.) Mathematics of evolution and phylogeny, Oxford University Press, Oxford (2005)