Title: A New Solution for Maximal Clique Problem based Sticker Model
Abstract: In this paper, we use stickers to construct a solution space of DNA for the maximal clique problem (MCP). Simultaneously, we also apply the DNA operation in the sticker-based model to develop a DNA algorithm. The results of the proposed algorithm show that the MCP is resolved with biological operations in the sticker-based model for the solution space of the sticker. Moreover, this work presents clear evidence of the ability of DNA computing to solve the NP-complete problem. The potential of DNA computing for the MCP is promising given the operational time complexity of O(n × k).
Publication Year: 2009
Publication Date: 2009-02-01
Language: en
Type: article
Indexed In: ['crossref', 'pubmed']
Access and Citation
Cited By Count: 21
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot