Abstract
Molecular programming(MP) has been proposed as an evolutionary computation algorithm at the molecular level. MP is different from other evolutionary algorithms in its representation of solutions using DNA molecular structures and its use of bio-lab techniques for recombination of partial solution. In this paper, Chinese Postman Problem(CPP) has been solved by means of molecular programming. We make use of the encoding scheme of S.Y.Shin for encoding real values. The new method is biologically plausible and has a fixed code length.
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.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)
Ouyang, Q., Kaplan, P.D., Liu, S.M.: DNA Solution of the Maximal Clique Problem. Science 278, 446–449 (1997)
Liu, Q.: DNA Computing on Surfaces. Nature 403, 175–179 (2000)
Wu, H.: An Improved Surface-based Method for DNA Computation. Biosystems 59, 1–5 (2001)
Shi, X.L., Li, X., Zhang, Z., et al.: Improve Capability of DNA Automaton: DNA Automaton with Three Internal States and Tape Head Move in Two Directions. In: Huang, D.-S., Zhang, X.-P., Huang, G.-B. (eds.) ICIC 2005. LNCS, vol. 3645, pp. 71–79. Springer, Heidelberg (2005)
Yin, Z., Zhang, F., Xu, J., et al.: A General 0-1 Programming Problem Based on DNA Computing. Biosystems 70, 73–79 (2003)
Head, T.: Formal Language Theory and DNA: an Analysis of the Generative Capacity of Specific Recombinant Behaviors. Bull. Math. Biol 49, 737–759 (1987)
Shine, S.Y.: Solving Travelling Problems using Molecular Programming. IEEE 35, 994–1000 (1999)
Zhang, B.T., Shin, S.Y.: Code Optimization for DNA Computing of Maximal Cliques. In: Advances in Soft Computing-Engineering Design and Manufacturing, Springer, Heidelberg (1998)
Yin, Z., Zhang, F., Xu, J.: A Chinese Postman Problem Based on DNA Computing. Journal of Chemical Information and Computing Science 42, 222–224 (2002)
Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. The Macmillan Press LTD (1976)
Yin, Z.: DNA computing in Graph and combinatorial optimization. Science Press, BeiJin (2004)
Mirzabekov, A.D.: DNA sequencing by hybridization a megasequencing method and adiagnostic tool. Tibtech 12, 27–32 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bo, J., Xiaoying, S., Zhibang, X. (2006). A Novel Approach Model for Chinese Postman Problem. In: Huang, DS., Li, K., Irwin, G.W. (eds) Computational Intelligence and Bioinformatics. ICIC 2006. Lecture Notes in Computer Science(), vol 4115. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11816102_25
Download citation
DOI: https://doi.org/10.1007/11816102_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37277-6
Online ISBN: 978-3-540-37282-0
eBook Packages: Computer ScienceComputer Science (R0)