[ 1 ] Feynman RP. Minaturization. New York: Reinhold; 1961.

[ 2 ] Adleman LM. Molecular computation of solutions to combinatorial problems. Science 1994;266(5187):1021–4. 链接1

[ 3 ] Lipton RJ. DNA solution of hard computational problems. Science 1995;268 (5210):542–5. 链接1

[ 4 ] Ouyang Q, Kaplan PD, Liu S, Libchaber A. DNA solution of the maximal clique problem. Science 1997;278(5337):446–9. 链接1

[ 5 ] Sakamoto K, Gouzu H, Komiya K, Kiga D, Yokoyama S, Yokomori T, et al. Molecular computation by DNA hairpin formation. Science 2000;288 (5469):1223–6. 链接1

[ 6 ] Rothemund PWK. A DNA and restriction enzyme implementation of turing machines. In: Lipton RJ, Baum EB, editors. DNA based computers. Providence: American Mathematical Society; 1995. p. 75–119.

[ 7 ] Benenson Y, Paz-Elizur T, Adar R, Keinan E, Livneh Z, Shapiro E. Programmable and autonomous computing machine made of biomolecules. Nature 2001;414 (6862):430–4. 链接1

[ 8 ] Benenson Y, Gil B, Ben-Dor U, Adar R, Shapiro E. An autonomous molecular computer for logical control of gene expression. Nature 2004;429 (6990):423–9. 链接1

[ 9 ] Winfree E. Algorithmic self-assembly of DNA [dissertation]. Pasadena: California Institute of Technology; 1998. 链接1

[10] Braich RS, Chelyapov N, Johnson C, Rothemund PW, Adleman L. Solution of a 20-variable 3-SAT problem on a DNA computer. Science 2002;296 (5567):499–502. 链接1

[11] Berge C, Minieka E. Graphs and hypergraphs. New York: Elsevier Science Publishing Co, Inc.; 1973.

[12] Briggs P, Cooper KD, Dennedy K, Torczon L. Coloring heuristics for register allocation. In: Proceedings of the ACM SIGPLAN 1989 conference on programming language design and implementation. 1989 Jun 19–23; Portland, OR, USA; 1989. p. 275–84. 链接1

[13] Chaitin GJ. Register allocation & spilling via graph coloring. In: Proceedings of the ACM SIGPLAN 1982 conference on compiler construction; 1982 Jun 23–25; Boston, MA, USA; 1982. p. 98–105. 链接1

[14] Johnson DS. Worst case behavior of graph coloring algorithm. In: Proceedings of the 5th southeastern conference on combinatorics, graph theory and computing; 1974 Feb 25–Mar 1; Boca Raton, FL, USA; 1974. p. 513–27.

[15] Blum A. New approximation algorithms for graph coloring. J Assoc Comput Mach 1994;41(3):470–516. 链接1

[16] Karger D, Motwani R, Sudan M. Approximate graph coloring by semi-definite programming. J Assoc Comput Mach 1998;45(2):246–65. 链接1

[17] Schiermeyer I. Deciding 3-colorability in less than O(1.415n) steps. In: Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science; 1993 Jun 16–18; Utrecht, The Netherlands. London: Springer; 1993. p. 177–88. 链接1

[18] Beigel R, Eppstein D. 3-coloring in time O(1.3289n). J Algorithms 2005;54 (2):168–204. 链接1

[19] Jonoska N, Karl SA, Saito M. Three dimensional DNA structures in computing. Biosystems 1999;52(1–3):143–53. 链接1

[20] Jonoska N, Sa-Ardyen P, Seeman NC. Computation by self-assembly of DNA graphs. Genet Program Evolvable Mach 2003;4(2):123–37. 链接1

[21] Sa-Ardyen P, Jonoska N, Seeman NC. Self-assembling DNA graphs. Nat Comput 2003;2(4):427–38.

[22] Liu W, Zhang F, Xu J. A DNA algorithm for the graph coloring problem. J Chem Inf Comput Sci 2002;42(5):1176–8. 链接1

[23] Gao L, Xu J. A DNA algorithm for graph vertex coloring problem. Acta Electronic Sinica 2003;31:494–6.

[24] Xu J, Qiang X, Fang G, Zhou K. A DNA computer model for solving vertex coloring problem. Chin Sci Bull 2006;51(20):2541–9. 链接1

[25] Garey MR, Johnson DS. Computers and intractability: A guide to the theory of NP-completeness. New York: W. H. Freeman & Co.; 1979. 链接1

[26] Bondy JA, Murty USR. Graph theory with applications. New York: American Elsevier Publishing Company, Inc.; 1976.

[27] Zhang K, Pan L, Xu J. A global heuristically search algorithm for DNA encoding. Prog Nat Sci 2007;17(6):745–9. 链接1

[28] Biggs N. Algebraic graph theory. 2nd ed. Cambridge: Cambridge University Press; 1993.