Warning: The NCBI web site requires JavaScript to function. more...
Generate a file for use with external citation management software.
University of Birjand, Factuality of Sciences, Department of Mathematics, Birjand, South Khorasan, Iran. darehmiraki@yahoo.com
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(nxk).
Your browsing activity is empty.
Activity recording is turned off.
Turn recording back on