Using DNA to solve the maximum weight clique of graphs

Tien Tzu Hsueh Pao/Acta Electronica Sinica

Volumn 32, Issue 1, 2004, Pages 13-16

  Ma, Run Nian ^a   Zhang, Qiang ^b,c   Gao, Lin ^d   Xu, Jin ^c  

^a AIR FORCE ENGINEERING UNIVERSITY   (China)

^b DALIAN UNIVERSITY OF TECHNOLOGY   (China)

^c DALIAN UNIVERSITY   (China)

^d XIDIAN UNIVERSITY   (China)

Author keywords

DNA computing; Maximum weight clique; NP complete problem

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DNA; GRAPH THEORY;

ADJACENT VERTICES; DNA COMPUTING; MAXIMUM WEIGHT CLIQUE; PLASMOID TECHNOLOGY; UNDIRECTED GRAPHS;

OPTIMIZATION;

EID: 2342430640     PISSN: 03722112     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (8)

1. Bomze I M, Pelillo M, Stix V. Approximating the maximum weight clique using replicator dynamics [J]. IEEE Trans. Neural Networks, 2000, 11(6): 1228-1241.
2. Adleman L M. Molecular computation of solution to combinatorial problems [J]. Science, 1994, 266(11): 1021-1024.
3. Lipton R J. DNA solution of computational problems [J]. Science, 1995, 268(4): 542-545.
4. Ouyang Q, Kaplan P D, Liu S, et al. Solution of the maximal clique problem [J]. Science, 1997, 278(17): 446-449.
5. Head T, Rozenberg G, Bladergroen R S, et al. Computing with DNA by operating on plasmoids [J]. Biosystems, 2000, 57: 87-93.
6. Liu Q, Wang L, Frutos A G, et al. DNA computing on surface [J]. Nature, 2000, 403(13): 175-179.