论文信息 - The approximate period problem for DNA alphabet - 字舞流文

The approximate period problem for DNA alphabet

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

[1] Bin Ma,et al. Distinguishing string selection problems , 2003, SODA '99.

[2] Jeong Seop Sim,et al. Approximate periods of strings , 2001, Theor. Comput. Sci..

[3] Ami Litman,et al. On covering problems of codes , 1997, Theory of Computing Systems.

[4] Pavel A. Pevzner. Multiple Alignment with Guaranteed Error Bounds and Communication Cost , 1992, CPM.

[5] P. Pevzner. Multiple alignment, communication cost, and graph matching , 1992 .

[6] R. Moyzis,et al. The human telomere. , 1991, Scientific American.