Using Sticker Model to Solve the Clique Problem on DNA-Based Computing

摘要

In this paper, it demonstrates how to use a sticker-based model to design a simple DNA-based algorithm for solving the clique problem. We first construct the solution space of memory complexes for the clique problem via the sticker-based model. Then, with biological operations, separate and combine, we remove those which encode illegal vertices from the solution space of memory complexes. The computation proceeds by using an inverted electronic version of gel electrophoresis to obtain a solution of the maximum clique problem.