Multiple genome rearrangement by swaps and by element duplications
2007, Theoretical Computer Science 385 (1-3), 115-126, 2007Citas: 85
Agregar PDF Importar citas Importar citas SCRAPME Plots Conexiones
Autor(es)
V Yu Popov
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.