Abstract
Molecular programming is applied to minimum spanning problem whose solution requires encoding of real values in DNA strands. A new encoding scheme is proposed for real values that is biologically plausible and has a fixed code length. According to the characteristics of the problem, a DNA algorithm solving the minimum spanning tree problem is given. The effectiveness of the proposed method is verified by simulation. The advantages and disadvantages of this algorithm are discussed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. P. Feynman, Miniaturization, D. H. Gilbert (Ed.), New York, Reinhold, 1961, 282–296.
L. M. Adleman, Molecular computation of solutions to combinatorial problem, Science, 266(1994)11, 1021–1024.
Q. Ouyang, et al., Solution of the maximal clique problem, Science, 278(1997)17, 446–449.
R. J. Lipton, DNA solution of hard computational problems, Science, 268(1995)4, 542–545.
K. H. Zimmermann, Efficient DNA sticker algorithms for NP-complete graph problems, Computer Physics Communications, 144(2002)3, 297–309.
N. Jonoska, S. Karl, M. Saito, Graph Structures in DNA Computing, in Computing with Bio-Molecules, Theory and Experiments, G. H. Paun (ed.), Springer-Verlag, 1998, 93–110.
B. T. Zhang, S. Y. Shin, Molecular Algorithms for Efficient and Reliable DNA Computing, Genetic Programming, J. R. Koza, et al. (ed.), Morgan Kaufmann, 1998, 735–742.
Author information
Authors and Affiliations
Additional information
Communication author: Liu Xikui, born in 1973, male, Ph.D. College of Information and Engineering, Shandong University of Science and Technology, Qingdao 266510, China.
About this article
Cite this article
Liu, X., Li, Y. & Xu, J. Solving minimum spanning tree problem with DNA computing. J. of Electron.(China) 22, 112–117 (2005). https://doi.org/10.1007/BF02688136
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02688136