DNA Simulation of Nand Boolean Circuits
暂无分享,去创建一个
[1] Max H. Garzon,et al. Good encodings for DNA-based solutions to combinatorial problems , 1996, DNA Based Computers.
[2] Minyi Guo,et al. Molecular solutions for the subset-sum problem on DNA-based supercomputing. , 2004, Bio Systems.
[3] Clifford R. Johnson,et al. Solution of a 20-Variable 3-SAT Problem on a DNA Computer , 2002, Science.
[4] Max H. Garzon,et al. Reliability and Efficiency of a DNA-Based Computation , 1998 .
[5] M. Guo,et al. Solving the set cover problem and the problem of exact cover by 3-sets in the Adleman-Lipton model. , 2003, Bio Systems.
[6] Mitsunori Ogihara,et al. DNA-Based Self-Propagating Algorithm for Solving Bounded-Fan-In Boolean Circuits , 1999 .
[7] Max H. Garzon,et al. DNA implementation of nondeterminism , 1997, DNA Based Computers.
[8] Martyn Amos,et al. DNA simulation of boolean circuits , 1998 .
[9] Martyn Amos,et al. Error-resistant implementation of DNA computations , 1996, DNA Based Computers.
[10] In-Hee Lee,et al. Evolutionary sequence generation for reliable DNA computing , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).