Author:
Tulpan Dan C.,Hoos Holger H.
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. R. S. Braich, C. Johnson, P.W.K. Rothemund, D. Hwang, N. Chelyapov, and L. M. Adleman, “Solution of a satisfiability problem on a gel-based DNA computer”, Preliminary Proc. Sixth International Meeting on DNA Based Computers, Leiden, The Netherlands, June, 2000.
2. S. Brenner and R. A. Lerner, “Encoded combinatorial chemistry”, Proc. Natl. Acad. Sci. USA, Vol 89, pages 5381–5383, June 1992.
3. R. Deaton, R. C. Murphy, M. Garzon, D. R. Franceschetti, and S. E. Stevens, Jr., “Good encodings for DNA-based solutions to combinatorial problems,” Proc. DNA Based Computers II, DIMACS Workshop June 10–12, 1996, L. F. Landweber and E.B. Baum, Editors, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 44, pages 247–258, 1999.
4. R. Deaton, M. Garzon, R. C. Murphy, J. A. Rose, D. R. Franceschetti, and S. E. Stevens, Jr., “ Genetic search of reliable encodings for DNA-based computation,” Koza, John R., Goldberg, David E., Fogel, David B., and Riolo, Rick L. (editors), Proceedings of the First Annual Conference on Genetic Programming 1996.
5. A. A. El Gamal, L. A. Hemachandra, I. Shperling, and V. K. Wei, “Using simulated annealing to design good codes,” IEEE Transactions on Information Theory, Vol. IT-33, No. 1, January 1987.
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献