Peptide Computing - Universality and Complexity

This paper considers a computational model using the peptide-antibody interactions. These interactions which are carried out in parallel can be used to solve NP-complete problems. In this paper we show how to use peptide experiments to solve the Hamiltonian Path Problem (HPP) and a particular version of Set Cover problem called Exact Cover by 3-Sets problem. We also prove that this of model of computation is computationally complete.

[1]  R J Lipton,et al.  DNA solution of hard computational problems. , 1995, Science.

[2]  L M Adleman,et al.  Molecular computation of solutions to combinatorial problems. , 1994, Science.

[3]  Klaus W. Wagner,et al.  On the Power of DNA-Computing , 1996, Inf. Comput..

[4]  K Shreder,et al.  Synthetic haptens as probes of antibody response and immunorecognition. , 2000, Methods.

[5]  榊原 康文,et al.  G. Paun, G. Rozenberg and A. Salomaa : "DNA Computing-New Computing Paradigms", Springer-Verlag (1998) , 2000 .

[6]  David I. Lewin,et al.  DNA computing , 2002, Comput. Sci. Eng..

[7]  David Maier,et al.  Review of "Introduction to automata theory, languages and computation" by John E. Hopcroft and Jeffrey D. Ullman. Addison-Wesley 1979. , 1980, SIGA.

[8]  室 章治郎.  Michael R.Garey/David S.Johnson 著, "COMPUTERS AND INTRACTABILITY A guide to the Theory of NP-Completeness", FREEMAN, A5判変形判, 338+xii, \5,217, 1979 , 1980 .

[9]  Kozo Kinoshita,et al.  Ligation errors in DNA computing. , 1999, Bio Systems.

[10]  E. Ishikawa,et al.  Ultrasensitive Enzyme Immunoassay , 1978, Clinica chimica acta; international journal of clinical chemistry.

[11]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  A. Condon,et al.  Demonstration of a word design strategy for DNA computing on surfaces. , 1997, Nucleic acids research.

[14]  Nadia Pisanti,et al.  DNA Computing: A Survey , 1998, Bull. EATCS.