Advertisement

DNA Algorithm Based on K-Armed Molecule and Sticker Model for Shortest Path Problem

  • Hong Zheng
  • Zhili Pei
  • Qing’an Yao
  • QingHu Wang
  • Yanchun Liang
Part of the Advances in Intelligent and Soft Computing book series (AINSC, volume 145)

Abstract

DNA computing is a computing paradigm based on biochemical reactions by using DNA molecule. Because of its advantages, such as mass storage and parallelism, it has been used to solve many complex problems. Shortest path problem is a frequently used problem in practical application. In this paper, a DNA algorithm based on k-armd molecule and sticker model to solve shortest path problem for weighted graph is proposed. The encoding method for the vertex, edges and weights is described in detail. This method shorten the length of the DNA strands for the weight code and may decrease the error during the biochemical reaction in a certain degree. The solving process for shortest path problem is also described in this paper.

Keywords

DNA computing k-armed molecule sticker model shortest path problem 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Adleman Leonard, M.: Molecular Computation of Solution to Combinatorial Problems. Science 66, 1021–1024 (1994)CrossRefGoogle Scholar
  2. 2.
    Lipton Richard, J.: DNA Solution of Hard Computational Problems. Science 268, 542–545 (1995)CrossRefGoogle Scholar
  3. 3.
    Ouyang, Q., Kaplan, P.D., Liu, S., et al.: DNA solution of the maximal clique problem. Science 278, 446–449 (1997)CrossRefGoogle Scholar
  4. 4.
    Shin, S.Y., Zhang, B.T., Jun, S.S., et al.: Solving traveling salesman problems using molecula programming. In: Proc of the 1999 Congress on Evolutionary Computation, pp. 994–1000. IEEE Press (1999)Google Scholar
  5. 5.
    Jonoska, N., Karl, S.A., Saito, M.: Three dimensional DNA structures in computing. Biosystems 52, 143–153 (1999)CrossRefGoogle Scholar
  6. 6.
    Xu, J., Tan, G.-J., Fan, Y.-K., Guo, Y.-A.: DNA Computing Principle, Progress and Difficulty(IV)—Discussion on DNA Computing Model. Chinese Journal of Computers 36, 881–893 (2007)MathSciNetGoogle Scholar
  7. 7.
    Yamamoto, M., Matsuura, N., Shiba, T., Kawazoe, Y., Ohuchi, A.: Solutions of Shortest Path Problems by Concentration Control. In: Jonoska, N., Seeman, N.C. (eds.) DNA 2001. LNCS, vol. 2340, pp. 203–240. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  8. 8.
    Lee, J.Y., Shin, S.Y., Park, T.H., et al.: Solving traveling salesman problems with DNA molecules encoding numerical values. BioSystems 78, 39–47 (2004)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag GmbH Berlin Heidelberg 2012

Authors and Affiliations

  • Hong Zheng
    • 1
    • 2
  • Zhili Pei
    • 3
    • 4
  • Qing’an Yao
    • 2
  • QingHu Wang
    • 3
  • Yanchun Liang
    • 1
  1. 1.College of Computer Science and TechnologyJilin UniversityChangchunChina
  2. 2.College of Computer Science and EngineeringChangchun University of TechnologyChangchunChina
  3. 3.College of Computer Science and TechnologyInner Mongolia University for the NationalitiesTongliaoChina
  4. 4.Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of EducationJilin UniversityChangchunChina

Personalised recommendations