Abstract
DNA computing is a novel method of solving a class of intractable computational problem, in which the computing speeds up exponentially with problem size. Up to now, many accomplishments have been made to improve its performance and increase its reliability. The positive integer linear programming is an NP-complete problem, in the paper, we solved the positive integer linear programming problem with fluorescence labeling techniques based on surface chemistry by attempted to apply DNA computing to programming problem. Our method has some significant advantages such as simple encoding, low cost, and short operating time.
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
Feynmam, R.P.: In: Minaturization. Gilbart, D.H. (ed.) Reinhold, New York, pp. 282–296 (1961)
Ouyang, Q.P., Kaplan, D.S., Liu, M., Libchaber, A.: DNA Solution of the Maximal Clique Problem. Science 278, 446–449 (1997)
Christos, H.: Papadimitriou, Combinatorial Optimization.: Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, New Jersey (1989)
Cox, J.C.: The Complexities of DNA Computation. TIBTECH 17, 151–154 (1996)
Adleman, L.M.: Molecular Computation of Solutions to Combinatorial Problems. Science 266, 1021–1023 (1994)
Lipton, R.J.: DNA Solution of Hard Computational Problems. Science 268, 542–545 (1995)
Liu, Q.: DNA Computing on Surfaces. Nature 403, 175–179 (2000)
Wu, H.Y.: An Improved Surface-Based Method for DNA Computation. Biosystems 59, 1–5 (2001)
Yin, Z.X., Zhang, F.Y., Xu, J.: A Chinese Postman Problem Based on DNA Computing. Journal of Chemical Information and Computing Science 42, 222–224 (2002)
Head, T.: Formal Language Theory and DNA: An Analysis of the Generative Capacity of Specific Recombinant Behaviors. Bull. Math. Biol. 49, 737–759 (1997)
Liu, Q.: Progress Toward Demonstration of A Surface Based DNA Computation: A One Word Approach to Solve A Model Satisfiability Problem. Biosystems 52, 25–33 (1999)
Sakamoto, K.G., Hidetaka, et al.: Molecular Computation by DNA Hairpin Formation. Science 288, 1223–1226 (2000)
Braich, R.S.: Solution of A 20-Variable 3-SAT Problem on A DNA Computer. Science 296, 499–502 (2002)
Yin, Z.X., Zhang, F.Y., Xu, J.: The General Form of 0-1 Programming Problem Based on DNA Computing. Biosystems 70, 73–78 (2003)
Wang, S.Y., Yang, A.M.: DNA Solution of Integer Linear Programming. Applied Mathematics and Computation (2005)
Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. The Macmillan Press, New York (1976)
Gass, S.L.: Linear Programming Methods and Applications, 5th edn. Mc Graw Hill, New York (1988)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Yin, Zx., Cui, Jz., Yang, J. (2007). A Surface-Based DNA Computing for the Positive Integer Linear Programming Problem. In: Huang, DS., Heutte, L., Loog, M. (eds) Advanced Intelligent Computing Theories and Applications. With Aspects of Theoretical and Methodological Issues. ICIC 2007. Lecture Notes in Computer Science, vol 4681. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74171-8_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-74171-8_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74170-1
Online ISBN: 978-3-540-74171-8
eBook Packages: Computer ScienceComputer Science (R0)