Abstract
Most DNA computing algorithms for mathematical problems start with combinatorial generation of an initial pool. Several methods for initial-pool generation have been proposed, including hybridization/ligation and mix/split methods. Here, we implement and compare parallel overlap assembly with the hybridization/ligation method. We applied these methods to the molecular algorithm to solve an instance of the graph problem with weighted edges. Our experimental results show that parallel overlap assembly is a better choice in terms of generation speed and material consumption than the hybridization/ligation method. Simulation of parallel overlap assembly was performed to investigate the potential and the limitation of the method.
This is a preview of subscription content, log in via an institution to check access.
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
Adleman, L.: Molecular computation of solutions to combinatorial problems. Science 266, 1021–1024 (1994)
Ouyang, Q., Kaplan, P.D., Liu, S., Libchaber, A.: DNA solution of the maximal clique problem. Science 278, 446–449 (1997)
Lee, J.Y., Shin, S.–Y., Park, T.H., Zhang, B.–T.: Temperature gradient-based DNA computing for graph problems with weighted edges. In: Hagiya, M., Ohuchi, A. (eds.) DNA 2002. LNCS, vol. 2568, pp. 73–84. Springer, Heidelberg (2003)
Braich, R.S., Chelyapov, N., Johnson, C., Rothemund, P.W.K., Adleman, L.: Solution of a 20-variable 3-SAT problem on a DNA computer. Science 296, 499–502 (2002)
Faulhammer, D., Cukras, A.R., Lipton, R.J., Landweber, L.F.: Molecular computation: RNA solutions to chess problems. Proc. Natl. Acad. Sci. USA 98, 1385–1389 (2000)
Stemmer, W.: DNA shuffling by random fragmentation and reassembly: in vitro recombination for molecular evolution. Proc. Natl. Acad. Sci. USA 91, 10747–10751 (1994)
Kaplan, P.D., Ouyang, Q.O., Thaler, D.S., Libchaber, A.: Parallel overlap assembly for the construction of computational DNA libraries. J. Theor. Biol. 188, 333–341 (1997)
Maheshri, N., Schaffer, D.V.: Computational and experimental analysis of DNA shuffling. Proc. Natl. Acad. Sci. USA 100, 3071–3076 (2003)
SantaLucia Jr., J.: A unified view of polymer, dumbbell, and oligonucleotide DNA nearest-neighbor thermodynamics. Proc. Natl. Acad. Sci. USA 95, 1460–1465 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, J.Y., Lim, HW., Yoo, SI., Zhang, BT., Park, T.H. (2005). Efficient Initial Pool Generation for Weighted Graph Problems Using Parallel Overlap Assembly. In: Ferretti, C., Mauri, G., Zandron, C. (eds) DNA Computing. DNA 2004. Lecture Notes in Computer Science, vol 3384. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11493785_19
Download citation
DOI: https://doi.org/10.1007/11493785_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26174-2
Online ISBN: 978-3-540-31844-6
eBook Packages: Computer ScienceComputer Science (R0)