ADLEMAN L M.Molecular computation of solutions to combinational problems[J].Science,1994,266:1021-1024.
[2]
LIPTON R J.DNA solution of hard computational problems[J].Science,1995,268:542-545.
[3]
LIU Q H,WANG L M,FRUTO A G,et al.DNA computing on surfaces[J].Nature,2000,403:175-179.
[4]
HEAD T,ROSENBERG G,BLADERGROEN R B,et al.Computing with DNA by operating on plasmids[J].Biosystems, 2000,57:87-93.
[5]
SAKAMOTO K,GOUZU H,KOMIYA K,et al.Molecular computation by DNA hairpin formation[J].Science,2000, 288:1223-1226.
[6]
FORDER S P,READ J L,PIRRUNG M C,et al.Light-directed spatially addressable parallel chemical synthesis[J]. Science,1991,251:767-773.
[7]
张凤月,殷志祥,许进.DNA芯片在0-1规划问题中的应用[J].生物化学与生物物理进展,2003,30(3):412-415. ZHANG Feng-yue,YIN Zhi-xiang,XU Jin.Application of DNA chip on 0-1 planning problem[J].Progress in Biochemistry and Biophysics,2003,30(3):412-415.(in Chinese)
[8]
马洪明,路新枝,王勇.四色荧光标记DNA自动测序中一例典型错读码的校正[J].海洋科学,2002,26(3):10-13. MA Hong-ming,LU Xin-zhi,WANG Yong.The correction of a typically false read code in DNA auto-sequence labeled by 4 color fluorescent dyes[J].Marine Sciences,2002,26(3):10-13.(in Chinese)
[9]
董德周.关于最大平面图着色的探讨——希伍德的反例是4-色的[J].科学通报,2002,18(4):304-309. DONG De-zhou.A study on the coloring of maximal planar graph-Heawood's counterexample is 4-color[J].Bulletin of Science and Technology,2002,18(4):304-309.(in Chinese)
[10]
OUYANG Q,KAPLAN P D,LIU S M,et al.DNA solution of the maximal clique problem[J].Science,1997,278: ??446-449.
