Multiple genome rearrangement by swaps and by element duplications

  • Popov V
  • 5

    Readers

    Mendeley users who have this article in their library.
  • 55

    Citations

    Citations of this article.

Abstract

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.

Author-supplied keywords

  • Distance function
  • Multiple sorting
  • NP-complete

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • V. Yu Popov

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free