Peptide Computing - Universality and Complexity

Authors:
M. Sakthi Balan;Kamala Krithivasan;Y. Sivasubrmanyam
Affiliations:
-;-;-
Venue:
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
Year:
2001

Citing 3
Cited 5

Molecular computation of solutions to combinatorial problems

Science
On the power of DNA-computing

Information and Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Aqueous computing: a survey with an invitation to participate

Journal of Computer Science and Technology
Complexity measures for binding-blocking automata

Journal of Automata, Languages and Combinatorics
String binding-blocking automata

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Peptide computing: universality and theoretical model

UC'06 Proceedings of the 5th international conference on Unconventional Computation
Incremental building in peptide computing to solve hamiltonian path problem

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.