Prev. Article Next Article Table of Contents

Research Article

DNA Solution of a Graph Coloring Problem

Addition/Correction

Yachun Liu,*^† Jin Xu,^‡ Linqiang Pan,^‡ and Shiying Wang^‡

Department of Mathematics and Physical Science, Nanhua University Hengyang, Hunan, 421001 P. R. China, and Department of Control Science and Engineering, Huazhong University of Science & Technology Wuhan, Hubei, 430074 P. R. China

J. Chem. Inf. Comput. Sci., 2002, 42 (3), pp 524–528

DOI: 10.1021/ci010016o

Publication Date (Web): March 26, 2002

Corresponding author e-mail: liuyachun65@263.net.

†

Nanhua University Hengyang.

‡

Huazhong University of Science & Technology Wuhan.

Abstract

The graph-theoretic parameter that has probably received the most attention over the years is the chromatic number. As is well-known, the coloring problem is an NP−Complete problem. In this paper, it has been solved by means of molecular biology techniques. The algorithm is highly parallel and has satisfactory fidelity. This work shows further evidence for the ability of DNA computing to solve NP−Complete problems.

View: Full Text HTML | Hi-Res PDF