1. A linear-time algorithm for computing inversion distance between signed permutations with an experimental study;Bader,2001
2. Fast sorting by reversals;Berman,1996
3. A. Bergeron, J. Mixtacki, J. Stoye, The inversion distance problem, in: O. Gascuel (Ed.), Mathematics of Evolution and Phylogeny, Chapter 10, Oxford University Press, Oxford, 2005, pp. 262–290.
4. Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals);Hannenhalli;J. Assoc. Comput. Mach.,1999
5. Faster and simpler algorithm for sorting signed permutations by reversals;Kaplan;SIAM J. Comput.,1999