Abstract
DNA computing has been proposed to solve the famous “SAT” problem of computer science since Adleman shows that DNA strands can be used to solve an instance of the NP-complete Hamiltonian path problem (HPP). Based on the Adleman-Lipton model and apply fluorescein-labeled operations, this paper put forward several DNA based parallel algorithms to control the running-time of algorithm to constant. In order to achieve this, some effective encode methods are designed to reduce the time complexity. In addition, the DNA parallel algorithms can improve the space complexity to a reasonable spectrum by introducing a trichotomy strategy. The analysis of the computational complexity for algorithm model will show you the advantage of the fluorescence model.
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.
Similar content being viewed by others
References
Adleman, L.: Molecular Computation of Solutions to Combinatarial Problems. Science 266, 1021–1024 (1994)
Lipton, R.: DNA Solution of Hard Computational Problems. Science 268, 542–545 (1995)
Ouyang, Q., Kaplan, P.D., Liu, S., Libchaber, A.: DNA Solution of the Maximal Clique Problem. Science 278, 446–449 (1997)
Sakamoto, K.: Molecular Computation by DNA Hairpin Formation. Science 288, 1223–1226 (2000)
Faullhammer, D., Cukras, A.R., Lipton, R.J., Landweber, L.F.: Molecular computation: RNA Solutions to Chess Problems. Proc.Natl. Acad. Sci. U.S.A 97, 1385–1389 (2000)
Braich, R.S., Chelyapov, N., Cliff, J., et al.: Solution of a 20-variable 3-SAT problem on a DNA computer. Science 296, 499–502 (2002)
Liu, Q., Wang, L., Frutos, A.G., et al.: DNA Computing on Surfaces. Nature 403, 175–179 (2003)
Li, D.F., Huang, H.T., Li, X.X., Li, X.R.: Hairpin Formation in DNA Computation Presents Limits for Large NP-complete Problems. BioSystems 72, 203–207 (2003)
Chang, W.L., Guo, M.: Solving the Set Cover Problem and the Problem of Exact Cover by 3-sets in the Adleman-Lipton Model. BioSystems 72, 263–275 (2003)
Guo, M.Y., Ho, M., Chang, W.L.: Fast Parallel Molecular Solution to the Dominating-set Problem on Massively Parallel Bio-computing. Parallel Computing 30, 1109–1125 (2004)
Chang, W.L., Guo, M.Y., Ho, M.: Towards Solution of the Set-splitting Problem on Gel-based DNA Computing. Future Generation Computer Systems 20, 875–885 (2004)
Yang, C.N., Yang, C.B.: A DNA Solution of SAT Problem by a Modified Sticker Model. BioSystems 81, 1–9 (2005)
Liu, W., Guo, Y., et al.: Grouping Parallel Algorithm Model of 3-SAT in DNA Computing. Impulsive Dynamic Systems and Appliations 4, 1533–1535 (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, J., Liu, W., Gao, Y., Sun, S. (2007). Fluorescence Model of 3-SAT in DNA Computing. In: Huang, DS., Heutte, L., Loog, M. (eds) Advanced Intelligent Computing Theories and Applications. With Aspects of Contemporary Intelligent Computing Techniques. ICIC 2007. Communications in Computer and Information Science, vol 2. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74282-1_50
Download citation
DOI: https://doi.org/10.1007/978-3-540-74282-1_50
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74281-4
Online ISBN: 978-3-540-74282-1
eBook Packages: Computer ScienceComputer Science (R0)