Abstract
Although DNA (deoxy-ribo nucleic acid) can perform 10 22 computations per second, it is time intensive and complex to set up input and output of data to and from a biological computer and to filter the final result. This paper, discusses how to simulate DNA computing on a digital computer to solve the Hamiltonian path problem using Adleman’s model. The simulation serves as an educational tool to teach DNA computing without the elaborate bio-experiments. As an aside, it also digitally verifies Adleman’s notion of DNA computing to solve the Hamiltonian path problem. Future work will involve a parallel implementation of the algorithm and investigation of the possibility of construction of simple regular VLSI structures to implement the basics of the model for fixed-sized problems.
Assistant Professor
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
L. Adleman. “Molecular computation of solutions to combinatorial problems,” Science, v.266, pp.1021–1024, Nov.1994.
L. Adleman, “On constructing a molecular computer,” 1 st DIMACS workshop on DNA based computers, v.27, pp.1–21, Princeton, 1996.
M. Arita, M. Hagiya and A. Suyama, “Joining and rotating data with molecules,” Proceedings of IEEE international conference on evolutionary computation, pp.243–248, Indianapolis, 1997.
E. Baum and D. Boneh, “Running dynamic programming algorithms on a DNA computer,” 2 nd DIMACS workshop on DNA based computers, pp.141–147, Princeton, 1996.
E. Baum, “Building an associative memory vastly larger than the brain,” Science, v.268, pp.583–585, Apr. 1995.
R. Beigel and B. Fu, “Solving intractable problems with DNA computing,” Proceedings of the 13th Annual Conference on Computational Complexity, pp. 154–168, 1998.
D. Boneh, C. Dunworth and R. Lipton, “Breaking DES using a molecular computer,” 1 st DIMACS workshop on DNA based computers, pp.37–65, v. 27, Princeton, 1996.
R. Deaton, R. Murphy, J. Rose, M. Garzon, D. Franceschetti and S. Stevens. “A DNA based implementation of an evolutionary search for good encodings for DNA computation,” Proc. of the IEEE international conference on evolutionary computation, pp. 267–271, Indianapolis, 1997.
R. P. Feynman, “There’s plenty of room at the bottom,” Miniaturization, Reinhold. pp.282–296, 1961.
F. Guarnieri, M. Fliss and C. Bancroft, “Making DNA add,” Science, pp.220–223, v.273, July 1996.
M. Hagiya, M. Arita, D. Kiga, K. Sakamoto and S. Yokoyama, “Towards parallel evaluation and learning of Boolean formulas with molecules,” DNA Based Computers III, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp.57–72, v.48, 1999.
N. Jonoska and S. Karl, “A molecular computation of the road coloring problem,” 2 nd DIMACS workshop on DNA based computers, pp.148–158, Princeton, 1996.
N. Jonoska and S. Karl, “Ligation experiments in computing with DNA,” Proceedings of IEEE International conference on evolutionary computation, pp.261–266, Indianapolis, 1977.
P. Kaplan, G. Cecchi and A. Libchaber, “DNA based molecular computation: template-template interactions in PCR,” 2 nd DIMACS workshop on DNA based computers, pp.159–171, Princeton, 1996.
P. Kaplan, G. Cecchi and A. Libchaber, “Molecular computation: Adleman’s experiment repeated,” Technical report, NEC Research Institute, 1995.
S. Kobayashi, T. Yokomori, G. Sampei and K. Mizobuchi, “DNA implementation of simple horn clause computation,” Proceedings of IEEE international conference on evolutionary computation, pp.213–217, Indianapolis, 1977.
T. Leete, M. Schwartz, R. Williams, D. Wood, J. Salem and H. Rubin, “Massively parallel DNA computation: Expansion of symbolic determinants,” 2 nd DIMACS workshop on DNA based computers, pp.49–66, Princeton, 1996.
R. Lipton, “DNA solution of hard computational problems,” Science, v.268, pp.542–545, April 1995.
R. Lipton, “Using DNA to solve SAT,” http://www.cs.princeton.edu/~rjl.
Q. Liu, Z. Guo, A. Condon, R. Corn, M. Lagally and L. Smith, “A surface based approach to DNA computation,” 2 nd DIMACS workshop on DNA based computers, pp.206–216, Princeton, 1996.
J. Oliver, “Computation with DNA: matrix multiplication,” 2 nd DIMACS workshop on DNA based computers, pp.236–248, Princeton, 1996.
J. Reif, “Parallel Molecular Computation,” 7th annual ACM symposium on parallel algorithms and architectures, Santa Barbara, 1995.
R. R. Roweis, E. Winfree, R. Burgoyne, N. V. Chelyapov, M. F. Goodman, P. W. K. Rothemund and L. Adleman, “A sticker based architecture for DNA computation,” Proc. of the second annual meeting on DNA-based computers, Princeton, 1998.
N. Seemen et al, “The perils of polynucleotides: the new experimental gap between the design and assembly of unusual DNA structures,” 2 nd DIMACS workshop on DNA based computers, pp.191–205, Princeton, 1995.
R. Williams and D. Woods, “Exascale computer algebra problems interconnect with molecular reactions and complexity theory,” 2 nd DIMACS workshop on DNA based computers, pp.260–268, Princeton, 1996.
E. Winfree, X. Yang and N. Seemen, “Universal computation via self assembly of DNA: some theory and experiments,” 2 nd DIMACS workshop on DNA based computers, pp.172–190, Princeton, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baskiyar, S. (2002). Simulating DNA Computing. In: Sahni, S., Prasanna, V.K., Shukla, U. (eds) High Performance Computing — HiPC 2002. HiPC 2002. Lecture Notes in Computer Science, vol 2552. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36265-7_39
Download citation
DOI: https://doi.org/10.1007/3-540-36265-7_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00303-8
Online ISBN: 978-3-540-36265-4
eBook Packages: Springer Book Archive