3D DNA self-assembly for the maximum clique problem

Abstract

DNA self-assembly technology has brought some novel inspirations to the development of DNA computing. At present, there are many diversified computational models to solve various NP problems, some of which are very useful to solve complex NP problems. In this paper, we introduce how the 3D self-assembly model to solve the maximum clique problem, with the capacity of DNA molecules in massive parallel computation. In this model, the number of distinct tiles used in the computing is a constant - 15, computation time is θ(n2), and computation space is θ(n3). Our work makes a significant attempt to explore the computational power of 3D DNA self-assembly.