Title :
Maximum Weight Clique Problem Based on Sticker Model
Author :
Yin, Zhixiang ; Cui, Jianzhong ; Huang, Xiaohui ; Zhi, Linying
Author_Institution :
Sch. of Sci., Anhui Univ. of Sci. & Technol., Huainan, China
Abstract :
We encoded weight of vertex into a unique fixed length oligonucleotide segment and employed sticker model to solve the problem. The proposed method has two distinct characteristics. On one hand, we skipped generating initial data pool that contained every possible solution to the problem of interest, the key point of which is constructing the solution instead of searching solution in the vast initial data pool according to logic constraints. On the other hand, oligonucleotide segments were treated like variables which stored weights on vertices, no matter what kind number the weights are, integer or real. Therefore, the proposed method can solve the problem with arbitrary weight values and be applied to solve other weight-related problem. In addition, two types of molecules, PNA and molecular beacon were also employed in order to overcome shortcomings of sticker model. And we analyzed the feasibility of the proposed algorithm as well.
Keywords :
biocomputing; PNA beacon; arbitrary weight values; fixed length oligonucleotide segment; logic constraints; maximum weight clique problem; molecular beacon; sticker model; vast initial data pool; Algorithm design and analysis; Circuits; DNA computing; Data mining; Encoding; Logic; Presence network agents; Splicing; Traveling salesman problems; Turing machines; DNA Computing; Maximum weight clique; sticker model;
Conference_Titel :
Natural Computation, 2009. ICNC '09. Fifth International Conference on
Conference_Location :
Tianjin
Print_ISBN :
978-0-7695-3736-8
DOI :
10.1109/ICNC.2009.49