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

Author

Tsai, Sientang

Author_Institution

Dept. of Inf. Manage., Southern Taiwan Univ., Tainan

Volume

1

fYear

2008

fDate

11-13 Nov. 2008

Firstpage

171

Lastpage

176

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

biocomputing; DNA-based algorithm; DNA-based computing; deoxyribonucleic acid; gel electrophoresis; inverted electronic version; maximum clique problem; sticker-based model; Algorithm design and analysis; Annealing; Biological information theory; Biological system modeling; Biology computing; DNA computing; Electrokinetics; Electronic mail; Information management; Information technology; Clique Problem; DNA Algorithm; DNA-based Computing; NP-complete Problem; Sticker-based Model;

fLanguage

English

Publisher

ieee

Conference_Titel

Convergence and Hybrid Information Technology, 2008. ICCIT '08. Third International Conference on

Conference_Location

Busan

Print_ISBN

978-0-7695-3407-7

Type

conf

DOI

10.1109/ICCIT.2008.264

Filename

4682021