- Peptide computing
**Peptide computing**is a form ofcomputing which usespeptide s andmolecular biology , instead of traditionalsilicon -based computer technologies. The basis of this computational model is the affinity ofantibodies towards peptide sequences. Similar toDNA computing , the parallel interactions of peptide sequences and antibodies have been used by this model to solve a fewNP-complete problems. Specifically, thehamiltonian path problem (HPP) and some versions of theset cover problem are a few NP-complete problems which have been solved using this computational model so far. This model of computation has also been shown to be computationally universal (or Turing complete).This model of computation has some critical advantages over

DNA computing . For instance, whileDNA is made of four building blocks,peptide s are made of twenty building blocks. The peptide-antibody interactions are also more flexible with respect to recognition and affinity than an interaction between a DNA strand and its reverse complement. However, unlike DNA computing, this model is yet to be practically realized. The main limitation is the availability of specificmonoclonal antibodies required by the model.**See also***

DNA computing

*Parallel computing

*Computational complexity theory **References***cite journal

author = M. Sakthi Balan, Kamala Krithivasan, Y. Sivasubramanyam

year =2001

title = Peptide Computing - Universality and Complexity

journal = Lecture Notes in Computer Science

volume = 2340

issue =

pages = 290–299

url = http://www.csd.uwo.ca/~sakthi/hpp_revised.ps*cite journal

author = Hubert Hug and Rainer Schuler

year =2001

title = Strategies for the development of a peptide computer

journal = Bioinformatics

volume = 17

issue = 4

pages = 364–368

url = http://bioinformatics.oxfordjournals.org/cgi/reprint/17/4/364

doi = 10.1093/bioinformatics/17.4.364

*Wikimedia Foundation.
2010.*