Note: the approximate period problem for DNA alphabet

Authors:
V. Y. Popov
Affiliations:
Department of Mathematics and Mechanics, Ural State University, 620083 Ekaterinburg, Russia
Venue:
Theoretical Computer Science
Year:
2003

Citing 3
Cited 0

Multiple alignment, communication cost, and graph matching

SIAM Journal on Applied Mathematics
Distinguishing string selection problems

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Approximate periods of strings

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

We show that the approximate period problem for DNA alphabet is NP-complete.