DNA-Based algorithm for 0-1 planning problem

Authors:
L. Wang;Z. P. Chen;X. H. Jiang
Affiliations:
Department of Computer and Information Science, Fujian University of Technology, Fuzhou, Fujian, RP China;Department of Computer and Information Science, Fujian University of Technology, Fuzhou, Fujian, RP China;Department of Computer and Information Science, Fujian University of Technology, Fuzhou, Fujian, RP China
Venue:
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Year:
2005

Citing 1
Cited 0

Molecular computation of solutions to combinatorial problems

Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Biochemical reaction theory based DNA computation is of much better performance in solving a class of intractable computational problems such as NP-complete problems, it is important to study the DNA computation. A novel algorithm based on DNA computation is proposed, which solves a special category of 0-1 planning problem by using the surface-based fluorescence labeling technique. The analysis show that our new algorithm is of significant advantages such as simple encoding, low cost and short operating time, etc.