Computer Science and Information Technology Vol. 2(6), pp. 281 - 286
DOI: 10.13189/csit.2014.020603
Reprint (PDF) (390Kb)

Using Sticker Model to Solve the Clique Problem on DNA-Based Computing

Sientang Tsai ^*, Wei-Yeh Chen , Hui-ling Huang
Department of Information Management, Southern Taiwan University, Yuan Kung District, Tainan City, Taiwan

ABSTRACT

In this paper, it demonstrates how to use a sticker-based model to design a simple DNA-based algorithm for solving the clique problem. We first construct the solution space of memory complexes for the clique problem via the sticker-based model. Then, with biological operations, separate and combine, we remove those which encode illegal vertices from the solution space of memory complexes. The computation proceeds by using an inverted electronic version of gel electrophoresis to obtain a solution of the maximum clique problem.

KEYWORDS
DNA-Based Computing, NP-Complete Problems, Clique Problem

Cite This Paper in IEEE or APA Citation Styles
(a). IEEE Format:
[1] Sientang Tsai , Wei-Yeh Chen , Hui-ling Huang , "Using Sticker Model to Solve the Clique Problem on DNA-Based Computing," Computer Science and Information Technology, Vol. 2, No. 6, pp. 281 - 286, 2014. DOI: 10.13189/csit.2014.020603.

(b). APA Format:
Sientang Tsai , Wei-Yeh Chen , Hui-ling Huang (2014). Using Sticker Model to Solve the Clique Problem on DNA-Based Computing. Computer Science and Information Technology, 2(6), 281 - 286. DOI: 10.13189/csit.2014.020603.