Abstract.
Cook’s Theorem [4, 5] is that if one algorithm for an NP-complete problem will be developed, then other problems will be solved by means of reduction to that problem. Cook’s Theorem has been demonstrated to be right in a general digital electronic computer. In this paper, we propose a DNA algorithm for solving the vertex-cover problem. It is demonstrated that if the size of a reduced NP-complete problem is equal to or less than that of the vertex-cover problem, then the proposed algorithm can be directly used for solving the reduced NP-complete problem and Cook’s Theorem is correct on DNA-based computing. Otherwise, Cook’s Theorem is incorrect on DNA-based computing and a new DNA algorithm should be developed from the characteristic of NP-complete problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Sinden, R.R.: DNA Structure and Function. Academic Press, London (1994)
Adleman, L.: Molecular computation of solutions to combinatorial problems. Science 266, 1021–1024 (1994)
Lipton, R.J.: DNA solution of hard computational problems. Science 268, 542–545 (1995); Narayanan, A., Zorbala, S.: DNA algorithms for computing shortest paths. In: Koza, J.R., et al. (eds.) Genetic Programming 1998: Proceedings of the Third Annual Conference, pp. 718–724 (1998)
Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to algorithms
Garey, M.R., Johnson, D.S.: Computer and intractability. Freeman, San Fransico (1979)
Boneh, D., Dunworth, C., Lipton, R.J., Sgall, J.: On the computational Power of DNA. In Discrete Applied Mathematics. Special Issue on Computational Molecular Biology 71, 79–94 (1996)
Adleman, L.M.: On constructing a molecular computer. DNA Based Computers. In: Lipton, R., Baum, E. (eds.) DIMACS: series in Discrete Mathematics and Theoretical Computer Science, pp. 1–21. American Mathematical Society, Providence (1996)
Roweis, S., Winfree, E., Burgoyne, R., Chelyapov, N.V., Goodman, M.F., Rothemund, P.W.K., Adleman, L.M.: Sticker Based Model for DNA Computation. In: Landweber, L., Baum, E. (eds.) 2nd annual workshop on DNA Computing, Princeton University. DIMACS: series in Discrete Mathematics and Theoretical Computer Science, pp. 1–29. American Mathematical Society, Providence (1999)
Paun, G., Rozenberg, G., Salomaa, A.: DNA Computing: New Computing Paradigms. Springer, New York (1998) ISBN: 3-540-64196-3
Chang, W.-L., Guo, M.: Solving the Dominating-set Problem in Adleman- Lipton’s Model. In: The Third International Conference on Parallel and Distributed Computing, Applications and Technologies, Japan, pp. 167–172 (2002)
Chang, W.-L., Guo, M.: Solving the Clique Problem and the Vertex Cover Problem in Adleman-Lipton’s Model. In: IASTED International Conference, Networks, Parallel and Distributed Processing, and Applications, Japan, pp. 431-436 (2002)
Chang, W.-L., Guo, M.: Solving NP-Complete Problem in the Adleman-Lipton Model. In: The Proceedings of, International Conference on Computer and Information Technology, Japan, pp. 157-162 (2002)
Chang, W.-L., Guo, M.: solving the 3-Dimensional Matching Problem and the Set Packing Problem in Adleman-Lipton’s Mode. In: IASTED International Conference, Networks, Parallel and Distributed Processing, and Applications, Japan, pp. 455-460 (2002)
Braich, R.S., Johnson, C., Rothemund, P.W.K., Hwang, D., Chelyapov, N., Adleman, L.M.: Solution of a satisfiability problem on a gel-based DNA computer. In: Proceedings of the 6th International Conference on DNA Computation. LNCS, Springer, Heidelberg
Cukras, R., Faulhammer, D., Lipton, R.J., Landweber, L.F.: Chess games: A model for RNA-based computation. In: Proceedings of the 4th DIMACS Meeting on DNA Based Computers, held at the University of Pennsylvania, June 16-19, pp. 27–37 (1998)
LaBean, T.H., Winfree, E., Reif, J.H.: Experimental Progress in Computation by Self-Assembly of DNA Tilings. Theoretical Computer Science 54, 123–140 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chang, WL., Guo, M., Wu, J. (2003). Is Cook’s Theorem Correct for DNA-Based Computing?. In: Veidenbaum, A., Joe, K., Amano, H., Aiso, H. (eds) High Performance Computing. ISHPC 2003. Lecture Notes in Computer Science, vol 2858. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39707-6_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-39707-6_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20359-9
Online ISBN: 978-3-540-39707-6
eBook Packages: Springer Book Archive