Lecture Notes in Computer Science Volume 2340, 2002, pp 290-299

Peptide Computing - Universality and Complexity

* Final gross prices may vary according to local VAT.

Get Access

Abstract

This paper considers a computational model using the pep-tide-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.