Multiple genome rearrangement by swaps and by element duplications / Popov V. Yu. // THEORETICAL COMPUTER SCIENCE. - 2007. - V. 385, l. 1-3. - P. 115-126.

ISSN/EISSN:

0304-3975 / нет данных

Type:

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. (c) 2007 Elsevier B.V. All rights reserved.

Author keywords:

multiple sorting; distance function; NP-complete COMPLEXITY; INVERSIONS; REVERSALS; BRASSICA

DOI:

10.1016/j.tcs.2007.05.029

Web of Science ID:

ISI:000250417300010

Соавторы в МНС:

—

Другие поля

Поле	Значение
Month	OCT 15
Publisher	ELSEVIER SCIENCE BV
Address	PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS
Language	English
Keywords-Plus	COMPLEXITY; INVERSIONS; REVERSALS; BRASSICA
Research-Areas	Computer Science
Web-of-Science-Categories	Computer Science, Theory \& Methods
Author-Email	Vladimir.Popov@usu.ru
ResearcherID-Numbers	Popov, Vladimir/C-9868-2015 Popov, Vladimir/J-1440-2012
ORCID-Numbers	Popov, Vladimir/0000-0001-9671-681X
Number-of-Cited-References	29
Usage-Count-Last-180-days	1
Usage-Count-Since-2013	19
Journal-ISO	Theor. Comput. Sci.
Doc-Delivery-Number	224AL