Genetic Code-Based DNA Computation for the Hamiltonian Path Problem
Chapter
Keywords
Genetic Code Hamiltonian Path Problem Abstract Mathematical Model Biomolecular Technique Classical Turing Machine
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- [1]L. Adleman, Molecular computation of solutions to combinatorial problems, Science, v.266, pp. 1021–1024, Nov. 1994.Google Scholar
- [2]D. Boneh and R. Lipton, Making DNA computers error resistant. Technical report, Princetion University, CS-TR-491-495, 1996.Google Scholar
- [3]E. Baum and D. Boneh, Running dynamic programming algorithms on a DNA computer. the 2nd DIMACS workshop on DNA based computers, pp. 141–147, 1996.Google Scholar
- [4]F. H. C. Crick, The origin of the genetic code. Journal of Molecular Biology, vol. 38, pp. 367–379, 1968.CrossRefGoogle Scholar
- [5]T. Eng and B. Serridge, A surface-based DNA algorithm for minimal set cover. the 3rd DIMACS workshop on DNA based computers, pp. 74–82, June 1997.Google Scholar
- [6]L. R. Jaisingh. Theory and Problems of Abstract algebra. McGraw-Hill, second edition, 2004.Google Scholar
- [7]L. Landweber and R. Lipton. DNA2DNA computations: A Potential “Killer App”? the 3rd DIMACS workshop on DNA based computers, pp. 59–68, June 1997.Google Scholar
- [8]R. Lipton. Using DNA to solve NP-complete problem. Science, vol. 268, pp. 542–545, April 1995.Google Scholar
- [9]C. C. Maley. DNA computation: Theory, practice, and prospects, Evolutionary Computation, vol. 6, no. 3, pp. 201–229, 1998.Google Scholar
- [10]W. K. Purves, D. Sadava, G. H. Orians, and H. C. Heller. Life: The Science of Biology, Sinauer, 6th edition, 1994.Google Scholar
Copyright information
© Springer Science+Business Media, Inc. 2006