We consider the swap distance and the element duplication distance. We show that the swap centre permutation problem is NP-complete. We show that the element duplication centre problem is NP-complete. © 2007 Elsevier Ltd. All rights reserved.
Popov, V. Y. (2007). Multiple genome rearrangement by swaps and by element duplications. Theoretical Computer Science, 385(1–3), 115–126. https://doi.org/10.1016/j.tcs.2007.05.029