Skip to Main Content
The existence DNA computing models can solve most hard NP problems in theory. The graph isomorphism problem is a classical NP-hard problem. In this paper we proposed a DNA-based sticker algorithm, which uses the concept of incidence degree sequence to solve the graph isomorphism problem. The proposed algorithm is simplicity of operation and only O(2n) DNA strands is required in the worst case, where n is the vertex number of a graph.
Date of Conference: 17-19 Oct. 2009