Advertisement

A Novel Approach Model for Chinese Postman Problem

  • Jiang Bo
  • Shi Xiaoying
  • Xu Zhibang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4115)

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.

Keywords

Weight Sequence Position Sequence Polymerase Chain Reac Ligation Reaction Link Sequence 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Adleman, L.M.: Molecular Computation of Solutions to Combinatorial Problems. Science 266, 1021–1023 (1994)CrossRefGoogle Scholar
  2. 2.
    Lipton, R.J.: DNA Solution of Hard Computational Problems. Science 268, 542–545 (1995)CrossRefGoogle Scholar
  3. 3.
    Ouyang, Q., Kaplan, P.D., Liu, S.M.: DNA Solution of the Maximal Clique Problem. Science 278, 446–449 (1997)CrossRefGoogle Scholar
  4. 4.
    Liu, Q.: DNA Computing on Surfaces. Nature 403, 175–179 (2000)CrossRefGoogle Scholar
  5. 5.
    Wu, H.: An Improved Surface-based Method for DNA Computation. Biosystems 59, 1–5 (2001)CrossRefGoogle Scholar
  6. 6.
    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)CrossRefGoogle Scholar
  7. 7.
    Yin, Z., Zhang, F., Xu, J., et al.: A General 0-1 Programming Problem Based on DNA Computing. Biosystems 70, 73–79 (2003)CrossRefGoogle Scholar
  8. 8.
    Head, T.: Formal Language Theory and DNA: an Analysis of the Generative Capacity of Specific Recombinant Behaviors. Bull. Math. Biol 49, 737–759 (1987)MATHMathSciNetGoogle Scholar
  9. 9.
    Shine, S.Y.: Solving Travelling Problems using Molecular Programming. IEEE 35, 994–1000 (1999)Google Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. The Macmillan Press LTD (1976)Google Scholar
  13. 13.
    Yin, Z.: DNA computing in Graph and combinatorial optimization. Science Press, BeiJin (2004)Google Scholar
  14. 14.
    Mirzabekov, A.D.: DNA sequencing by hybridization a megasequencing method and adiagnostic tool. Tibtech 12, 27–32 (1994)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jiang Bo
    • 1
  • Shi Xiaoying
    • 2
  • Xu Zhibang
    • 2
  1. 1.Wuhan Second Ship Design and Research InstituteWuhanChina
  2. 2.School of Electronics and Electric EngineeringEast China Jiaotong UniversityNanchangP.R. China

Personalised recommendations