Peptide computing is a form of computing which uses peptides, instead of traditional electronic components. The basis of this computational model is the affinity of antibodies towards peptide sequences. Similar to DNA computing, the parallel interactions of peptide sequences and antibodies have been used by this model to solve a few NP-complete problems. Specifically, the hamiltonian path problem (HPP) and some versions of the set 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, while DNA is made of four building blocks, peptides 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 specific monoclonal antibodies required by the model.
M. Sakthi Balan; Kamala Krithivasan; Y. Sivasubramanyam (2001). Peptide Computing - Universality and Complexity. Lecture Notes in Computer Science. Vol. 2340. pp. 290–299. doi:10.1007/3-540-48017-X_27. ISBN978-3-540-43775-8.
Hubert Hug & Rainer Schuler (2001). "Strategies for the development of a peptide computer". Bioinformatics. 17 (4): 364–368. doi:10.1093/bioinformatics/17.4.364. PMID 11301306.
This computer science article is a stub. You can help Wikipedia by expanding it.
peptide, computing, this, article, includes, list, references, related, reading, external, links, sources, remain, unclear, because, lacks, inline, citations, please, help, improve, this, article, introducing, more, precise, citations, january, 2015, learn, wh. This article includes a list of references related reading or external links but its sources remain unclear because it lacks inline citations Please help improve this article by introducing more precise citations January 2015 Learn how and when to remove this message Peptide computing is a form of computing which uses peptides instead of traditional electronic components The basis of this computational model is the affinity of antibodies towards peptide sequences Similar to DNA computing the parallel interactions of peptide sequences and antibodies have been used by this model to solve a few NP complete problems Specifically the hamiltonian path problem HPP and some versions of the set 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 while DNA is made of four building blocks peptides 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 specific monoclonal antibodies required by the model See also editBiocomputers Computational gene Computational complexity theory DNA computing Molecular electronics Parallel computing Unconventional computing Molecular logic gateReferences editM Sakthi Balan Kamala Krithivasan Y Sivasubramanyam 2001 Peptide Computing Universality and Complexity Lecture Notes in Computer Science Vol 2340 pp 290 299 doi 10 1007 3 540 48017 X 27 ISBN 978 3 540 43775 8 Hubert Hug amp Rainer Schuler 2001 Strategies for the development of a peptide computer Bioinformatics 17 4 364 368 doi 10 1093 bioinformatics 17 4 364 PMID 11301306 nbsp This computer science article is a stub You can help Wikipedia by expanding it vte Retrieved from https en wikipedia org w index php title Peptide computing amp oldid 1188101291, wikipedia, wiki, book, books, library,
