Back to Search
Start Over
Peptide Computing - Universality and Complexity.
- Source :
- DNA Computing (9783540437758); 2002, p290-299, 10p
- Publication Year :
- 2002
-
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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISBNs :
- 9783540437758
- Database :
- Complementary Index
- Journal :
- DNA Computing (9783540437758)
- Publication Type :
- Book
- Accession number :
- 77210874
- Full Text :
- https://doi.org/10.1007/3-540-48017-X_27