A New Method to Optimize the Template Set in DNA Computing

Adleman L. Molecular computation of solution to combinatorialproblems [J].Science.1994, 266:1021-1024[2]Garzon M, et al.. A new metric for DNA computing [C].Proceedings of the 2nd Annual Genetic ProgrammingConference GP-97, Morgan Kaufmann, Stanford University,1997: 472-487.[3]Garzon M, Deaton R, Nino L F, Stevens S E , and Wittner M.Genome encoding for DNA computing [C]. TheThirdDIMACS Workshop on DNA-based Computing,Uinversity of Pennsylvania, 1997: 230-237.[4]Baum E B. DNA sequences useful for computation [C]. Proc.Second Annual Meeting on DNABased Computers, AmericanMathematical Society, Princton University, 1996: 235-242.[5]Feldkamp, et al.. A DNA sequence compile[C]. Proceedings of6th DIMACS Workshop on DNA Based Computers,Netherlands, 2000: 253-257.[6]Suyama A, et al.. DNA chips-integrated chemical circuits forDNA diagnosis and DNA computers [C]. Proc. 3rd InternationalMicromachine Symp., Tokyo, 1997: 7-12.[7] Morey J. Encoding Choices for Error Resistant DNAComputers[OL]. www.csd.uwo.ca /~morey /dnatalk/kevin/dna/dnaerror.html.[8]Braich R, Johnson C, Rothemund P, and Adleman L.Solution of a satisfiability problem on a Gel-based DNAcomputer [C]. DNA 2000, 2001, LCNS 2054: 27-42.[9]Frutos A, et al.. Demonstration of a word design strategy forDNA computing on surface [J].Nucleic Acids Research.1997,25(23):4748-4757[10]Liu Wenbin, Wang Shudong, Gao Lin，and Xu Jin. DNAsequence design based on template strategy [J]. Chem. Info.Comput. Sci, 2003, 43(6): 2014-2018.[11]SantaLucia J, Allawi H, and Seneviratne P. Improved nearest-neighbor parameters for predicting DNA duplex stability [J].Biochemistry.1996, 35(11):3555-3562[12]刘文斌. DNA 计算中的编码问题及模型研究. [博士论文], 武汉：华中科技大学, 2004.1.Liu Wen-bin. Research on the Enconding Problem andAlgorithms of DNA Computing. [Dissertation(Doctor)],Huazhong University of Science Technology, Wuhan, China,2004.1..