Biomolecular realizations of a parallel architecture for solving combinatorial problems

A coherent approach to the problem of carrying out computations in aqueous solution is provided. The conceptual level of the presentation provides for many different molecular realizations to be explored in the future. Severa l possibilities are suggested. Our initial implementations have provided we t lab prototype computations for two of the classical NP complete graph the oretic problems: the maximum independent set problem and the minimum domina ting set problem. A wet lab prototype computation is in progress for the de termination of the satisfiability of sets of disjunctive clauses.