• The KIPS Transactions:PartB
• /
• v.10B no.7
• /
• pp.769-776
• /
• 2003

DNA computing has used to solve MCP (Maximal Clique Problem). However, when current DNA computing is applied to MCP. it can't efficiently express vertices and edges and it has a problem that can't look for solutions, by misusing wrong restriction enzyme. In this paper we proposed ACO (Algorithm for Code Optimization) that applies DNA coding method to DNA computing to solve MCP's problem. We applied ACO to MCP and as a result ACO could express DNA codes of variable lengths and generate codes without unnecessary vertices than Adleman's DNA computing algorithm could. In addition, compared to Adleman's DNA computing algorithm, ACO could get about four times as many as Adleman's final solutions by reducing search time and biological error rate by 15%.