The approximate period problem for DNA alphabet / Popov VY // THEORETICAL COMPUTER SCIENCE. - 2003. - V. 304, l. 1-3. - P. 443-447.

ISSN/EISSN:

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

Type:

Article

Abstract:

We show that the approximate period problem for DNA alphabet is NP-complete. (C) 2003 Elsevier B.V. All rights reserved.

Author keywords:

periodicity; approximate periods; distance function; NP-complete

DOI:

10.1016/S0304-3975(03)00211-1

Web of Science ID:

ISI:000184305300022

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

—

Другие поля

Поле	Значение
Month	JUL 28
Publisher	ELSEVIER SCIENCE BV
Address	PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS
Language	English
Research-Areas	Computer Science
Web-of-Science-Categories	Computer Science, Theory \& Methods
ResearcherID-Numbers	Popov, Vladimir/J-1440-2012 Popov, Vladimir/C-9868-2015
ORCID-Numbers	Popov, Vladimir/0000-0001-9671-681X
Number-of-Cited-References	5
Usage-Count-Last-180-days	1
Usage-Count-Since-2013	19
Journal-ISO	Theor. Comput. Sci.
Doc-Delivery-Number	703WP