Using Implicit Enumeration to Solve 0-1 Planning Problem Based on DNA Computing
暂无分享,去创建一个
[1] Rudolf Freund,et al. Watson-Crick finite automata , 1997, DNA Based Computers.
[2] Xu Jin. DNA Computer Principle, Advances and Difficulties (I):Biological Computing System and Its Applications to Graph Theory , 2003 .
[3] H Wu. An improved surface-based method for DNA computation. , 2001, Bio Systems.
[4] Lloyd M. Smith,et al. DNA Computing on Surfaces : the Chemical Implementation , 2000 .
[5] L. M. Smith,et al. Automated synthesis and sequence analysis of biological macromolecules. , 1988, Analytical chemistry.
[6] Xu Jin,et al. The general form of 0-1 programming problem based on DNA computing. , 2003, Bio Systems.
[7] L M Adleman,et al. Molecular computation of solutions to combinatorial problems. , 1994, Science.
[8] David Harlan Wood,et al. Massively parallel DNA computation: Expansion of symbolic determinants , 1996, DNA Based Computers.
[9] R J Lipton,et al. DNA solution of hard computational problems. , 1995, Science.
[10] L F Landweber. The evolution of cellular computing. , 1999, The Biological bulletin.
[11] Anne Condon,et al. Multiple word DNA computing on surfaces , 2000 .