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.
Mendeley saves you time finding and organizing research
Choose a citation style from the tabs below