1. Blanchette, M., Kunisawa, T., and Sankoff, D., Gene Order Breakpoint Evidence in Animal Mitochondrial Phylogeny, J. Mol. Evol., 1999, vol. 49, no. 2, pp. 193–203.
2. Lyubetsky, V.A., Gershgorin, R.A., Seliverstov, A.V., and Gorbunov, K.Yu., Algorithms for Reconstruction of Chromosomal Structures, BMC Bioinformatics, 2016, vol. 17, Research Article40.
3. Yancopoulos, S., Attie, O., and Friedberg, R., Efficient Sorting of Genomic Permutations by Translocation, Inversion and Block Interchange, Bioinformatics, 2005, vol. 21, no. 16, pp. 3340–3346.
4. Hannenhalli, S. and Pevzner, P.A., Transforming Men into Mice (Polynomial Algorithm for Genomic Distance Problem), in Proc. 36th Annual Sympos. on Foundations of Computer Science (FOCS’95), Milwaukee, WI, USA, Oct. 23–25, 1995, pp. 581–592.
5. Bergeron, A., Mixtacki, J., and Stoye, J., A Unifying View of Genome Rearrangements, Algorithms in Bioinformatics (Proc. 6th Int. Workshop, WABI’2006, Zurich, Switzerland, Sept. 11–13, 2006), Bucher, P. and Moret, B.M.E., Eds., Lect. Notes Comp. Sci., vol. 4175, Berlin: Springer, 2006, pp. 163–173.