1. Bader DA, Moret BME, Yan M (2001) A linear-time algorithm for computing inversion distance between signed permutations with an experimental study. J Comput Biol 8(5):483–491. An earlier version of this work appeared In: The proceedings of 7th Int‘l workshop on algorithms and data structures (WADS 2001)
2. Badimo A, Bergheim A, Hazelhurst S, Papathanasopolous M, Morris L (2003) The stability of phylogenetic tree construction of the HIV-1 virus using genome-ordering data versus env gene data. In: Proceedings of ACM annual research conference of the South African institute of computer scientists and information technologists on enablement through technology (SAICSIT 2003), Port Elizabeth, Sept 2003, vol 47. ACM, Fourways, South Africa, pp 231–240
3. Bafna V, Pevzner PA (1993) Genome rearrangements and sorting by reversals. In: Proceedings of 34th annual IEEE symposium on foundations of computer science (FOCS93), Palo Alto, CA, pp 148–157. IEEE Press
4. Bafna V, Pevzner PA (1996) Genome rearrangements and sorting by reversals. SIAM J Comput 25:272–289
5. Bergeron A, Stoye J (2006) On the similarity of sets of permutations and its applications to genome comparison. J Comput Biol 13(7):1340–1354