Abstract
<BR><BR><BR>
Motivation: We devise a computational model using protein-protein
interactions.
<BR><BR>
Results: Peptide-antibody interactions can be used to perform a large
number of small logical operations in parallel. We show e.g. how a
sequence of operations can be used to compare the number of occurrences
of an element in two sets and how to estimate the number of occurrences
of an element in a set. Similar to DNA-computing, these techniques could
in principle be extended to solve instances of NP-complete problems. We
give as an example a procedure to solve instances of the satisfiability
problem.
<BR><BR><BR><BR>

Contact: hubert.hug@medizin.uni-ulm.de, schuler@informatik.uni-ulm.de