Multiple genome rearrangement by swaps and by element duplications

55Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free