DNA Computing Adopting DNA Coding Method to solve Maximal Clique Problem 


Vol. 10,  No. 7, pp. 769-776, Dec.  2003
10.3745/KIPSTB.2003.10.7.769


PDF
  Abstract

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%.

  Statistics
  Cite this article

[IEEE Style]

K. E. Gyeong and L. S. Yong, "DNA Computing Adopting DNA Coding Method to solve Maximal Clique Problem," The KIPS Transactions:PartB , vol. 10, no. 7, pp. 769-776, 2003. DOI: 10.3745/KIPSTB.2003.10.7.769.

[ACM Style]

Kim Eun Gyeong and Lee Sang Yong. 2003. DNA Computing Adopting DNA Coding Method to solve Maximal Clique Problem. The KIPS Transactions:PartB , 10, 7, (2003), 769-776. DOI: 10.3745/KIPSTB.2003.10.7.769.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals