Abstract
We have succeeded in solving an instance of a 6-variable 11-clause 3-SAT problem on a gel-based DNA computer. Separations were performed using probes covalently bound to polyacrylamide gel. During the entire computation, DNA was retained within a single gel and moved via electrophoresis. The methods used appear to be readily automatable and should be suitable for problems of a significantly larger size.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Leonard M. Adleman. Molecular computation of solutions to combinatorial problems. Science, 266:1021–1024, November 11, 1994.
Richard J. Lipton. DNA solution of hard computational problems. Science, 218:17–26, 1996
Dan Boneh, Christopher Dunworth, and Richard J. Lipton. Breaking DES using a molecular computer. In Richard J. Lipton and Eric B. Baum, editors, DNA Based Computers: Proceedings of a DIMACS Workshop, April 4, 1995, Princeton University, volume 27 of DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, pages 37–65, Providence, RI, 1996. American Mathematical Society.
Leonard M. Adleman, Paul W. K. Rothemund, Sam Roweis, and Erik Winfree. On applying molecular computation to the data encryption standard. Journal of Computational Biology, 6(1):53–63, 1999.
N. Jonoska and S. A. Karl. A molecular computation of the road coloring problem. In Laura F. Landweber, editors. DNA Based Computers II: DIMACS Workshop, June 10–12, 1996, volume 44 of DIMACS: Series in Discrete Mathematics and Theoretical Computer Science., Providence, RI, 1998. American Mathematical Society Baum and Landweber [25], pages 87–96.
Erik Winfree, Xiaoping Yang, and Nadrian C. Seeman. Universal computation via self-assembly of DNA: Some theory and experiments. In Laura F. Landweber, editors. DNA Based Computers II: DIMACS Workshop, June 10–12, 1996, volume 44 of DIMACS: Series in Discrete Mathematics and Theoretical Computer Science., Providence, RI, 1998. American Mathematical Society Baum and Landweber [25], pages 191–213.
Erik Winfree. Whiplash PCR for O(1) computing. In Proceedings of the 4th DIMACS Meeting on DNA Based Computers, held at the University of Pennsylvania, June 16–19, 1998, pages 175–188.
Martyn Amos, Alan Gibbons, and David Hodgson. Error-resistant implementation of DNA computations. In Laura F. Landweber, editors. DNA Based Computers II: DIMACS Workshop, June 10–12, 1996, volume 44 of DIMACS: Series in Discrete Mathematics and Theoretical Computer Science., Providence, RI, 1998. American Mathematical Society Baum and Landweber [25], pages 151–161.
Michail G. Lagoudakis and Thomas H. LaBean. 2-D DNA self-assembly for satisfiability. In Proceedings of the 5 th DIMACS Meeting on DNA Based Computers, held at the Massachusetts Institute of Technology, June 14–15, 1999, pages 139–152.
F. Guarnieri, M. Fliss, and Carter Bancroft. Making DNA add. Science, 273(5272):220–223, 1996.
Q. Ouyang, P. D. Kaplan, L. Shumao, and A. Libchaber. DNA solution of the maximal clique problem. Science, 278:446–449, 1997.
Nobuhiko Morimoto, Masanori Arita, and Akira Suyama. Solid phase DNA solution to the Hamiltonian Path Problem. In David Harlan Wood, editors. DNA Based Computers III: DIMACS Workshop, June 23–25, 1997, volume 48 of DIMACS: Series in Discrete Mathematics and Theoretical Computer Science., Providence, RI, 1999. American Mathematical Society Rubin and Wood [24], pages 83–101.
Thomas H. Leete, Joshua P. Klein, and Harvey Rubin. Bit operations using a DNA template. In David Harlan Wood, editors. DNA Based Computers III: DIMACS Workshop, June 23–25, 1997, volume 48 of DIMACS: Series in Discrete Mathematics and Theoretical Computer Science., Providence, RI, 1999. American Mathematical Society Rubin and Wood [24], pages 159–171.
Kensaku Sakamoto, Daisuke Kiga, Ken Komiya, Hidetaka Gouzu, Shigeyuki Yokoyama, Shuji Ikeda, Hiroshi Sugiyama, and Masami Hagiya. State transitions by molecules. In Proceedings of the 4 th DIMACS Meeting on DNA Based Computers, held at the University of Pennsylvania, June 16–19, 1998, pages 87–99.
Julia Khodor and David K. Gifford. Design and implementation of computational systems based on programmed mutagenesis. In Proceedings of the 4 th DIMACS Meeting on DNA Based Computers, held at the University of Pennsylvania, June 16–19, 1998, pages 101–107.
Dirk Faulhammer, A. R. Cukras, Richard J. Lipton, and Laura F. Landweber. When the knight falls: On constructing an RNA computer. In Proceedings of the 5 th DIMACS Meeting on DNA Based Computers, held at the Massachusetts Institute of Technology, June 14–15, 1999, pages 1–7.
Junghei Chen, Eugene Antipov, Bertrand Lemieux, Walter Cedeño, and David Harlan Wood. In vitro selection for a Max 1s DNA genetic algorithm. In Proceedings of the 5 th DIMACS Meeting on DNA Based Computers, held at the Massachusetts Institute of Technology, June 14–15, 1999, pages 23–37.
H. Yoshida and A. Suyama. Solution to 3-SAT by breadth first search. In Proceedings of the 5 th DIMACS Meeting on DNA Based Computers, held at the Massachusetts Institute of Technology, June 14–15, 1999, pages 9–20.
Masahito Yamamoto, Jin Yamashita, Toshikazu Shiba, Takuo Hirayama, Shigeharu Takiya, Keiji Suzuki, Masanabu Munekata, and Azuma Ohuchi. A study on the hybridization process in DNA computing. In Proceedings of the 5 th DIMACS Meeting on DNA Based Computers, held at the Massachusetts Institute of Technology, June 14–15, 1999, pages 99–108.
Q. Liu, L. Wang, A. G. Frutos, A. E. Condon, R. M. Corn, and L. M. Smith. DNA computing on surfaces. Nature, 403:175–179, 2000.
Sam Roweis, Erik Winfree, Richard Burgoyne, Nickolas V. Chelyapov, Myron F. Goodman, Leonard M. Adleman, and Paul W. K. Rothemund. A sticker-based model for DNA computation. Journal of Computational Biology, 5(4):615–629, 1998.
Kalim Mir. A restricted genetic alphabet for DNA computing. In Laura F. Landweber, editors. DNA Based Computers II: DIMACS Workshop, June 10–12, 1996, volume 44 of DIMACS: Series in Discrete Mathematics and Theoretical Computer Science., Providence, RI, 1998. American Mathematical Society Baum and Landweber [25], pages 243–246.
A. R. Cukras, Dirk Faulhammer, Richard J. Lipton, and Laura F. Landweber. Chess games: A model for RNA-based computation. In Proceedings of the 4th DIMACS Meeting on DNA Based Computers, held at the University of Pennsylvania, June 16–19, 1998, pages 27–37.
Harvey Rubin and David Harlan Wood, editors. DNA Based Computers III: DIMACS Workshop, June 23–25, 1997, volume 48 of DIMACS: Series in Discrete Mathematics and Theoretical Computer Science., Providence, RI, 1999. American Mathematical Society.
Eric B. Baum and Laura F. Landweber, editors. DNA Based Computers II: DIMACS Workshop, June 10–12, 1996, volume 44 of DIMACS: Series in Discrete Mathematics and Theoretical Computer Science., Providence, RI, 1998. American Mathematical Society.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Braich, R.S., Johnson, C., Rothemund, P.W.K., Hwang, D., Chelyapov, N., Adleman, L.M. (2001). Solution of a satisfiability problem on a gel-based DNA computer. In: Condon, A., Rozenberg, G. (eds) DNA Computing. DNA 2000. Lecture Notes in Computer Science, vol 2054. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44992-2_3
Download citation
DOI: https://doi.org/10.1007/3-540-44992-2_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42076-7
Online ISBN: 978-3-540-44992-8
eBook Packages: Springer Book Archive