Using DNA to Solve the Minimal Vertex Covering Problem

Article Preview

Abstract:

Plasmid DNA algorithm of the minimal vertex covering problem is proposed upon the basic idea and operation of plasmid DNA computing model. In the plasmid DNA algorithm, though an appropriate encoding and the basic biological operation, we finish the generation and separation of solution. On the basis of the molecular biology methods, the algorithm is feasible.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

2987-2990

Citation:

Online since:

November 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Adleman L: Science. Vol. 266, No. 11 (1994), pp.1021-1024.

Google Scholar

[2] Head T, Rozenberg G, Bladergroen R B, Breek c K D, Lommerse P H M, Spaink H P: BioSyste-ms. Vol. 57 (2000), pp.87-93.

DOI: 10.1016/s0303-2647(00)00091-5

Google Scholar

[3] Lipton R J: Science. Vol. 268, No. 4 (1995), pp.542-545.

Google Scholar

[4] Ouyang Q, Kaolan P D, Liu S, el al: Science. Vol. 278, No. 17 (1992), pp.446-449.

Google Scholar

[5] Naihu Wu: Principles of Gene Engineering (Science Press, Beijing 2002).

Google Scholar

[6] Jin Xu, Gangjun Tan, Yueke Fan: Chinese Journal of Computers. Vol. 30, No. 6 (2007), pp.881-893 (in Chinese).

Google Scholar

[7] Lin Gao, Runnian Ma, Jin Xu: Progress in Biochemistry and Biophysics. Vol. 29, No. 5(2002), pp.820-823 (in Chinese).

Google Scholar

[8] Runnian Ma, Qiang Zhang, Lin Gao and Jin Xu: Chinese Journal of Electronics. Vol. 32, No.1 (2004), pp.13-16 (in Chinese).

Google Scholar

[9] Zhixiang Yin, Jiaxiu Zhang: Journal of Systems Engineering and Electronics. Vol. 7, No. 29 (2007), pp.1159-1163 (in Chinese).

Google Scholar

[10] Lianzhen Zhang, Guangwu Liu and Jin Xu: Computer Engineering and Applications. Vol. 4, No. 1 (2004), pp.51-52 (in Chinese).

Google Scholar