Motivation: We devise a computational model using protein-protein interacti
ons.
Results: Peptide-antibody interactions can be used to perform a large numbe
r of small logical operations in parallel. We show for example how a sequen
ce of operations can be used to compare the number of occurrences of an ele
ment in two sets and how to estimate the number of occurrences of an elemen
t in a set. Similar to DNA-computing, these techniques could in principle b
e extended to solve instances of NP-complete problems. We give as an exampl
e a procedure to solve examples of the satisfiability problem.