DocumentCode :
510155
Title :
Using Implicit Enumeration to Solve 0-1 Planning Problem Based on DNA Computing
Author :
Huang, Xiaohui ; Yin, Zhixiang ; Zhi, Lingying ; Hu, Juan
Author_Institution :
Dept. of Math. & Phys., Anhui Univ. of Sci. & Technol., Huainan, China
Volume :
1
fYear :
2009
fDate :
7-8 Nov. 2009
Firstpage :
629
Lastpage :
633
Abstract :
DNA computing is a new approach to simulate the structure of biological molecules and compute using biotechnology, it creates a precedent of using biochemical reactions as the basis of calculation tools. This is a novel method for solving a class of intractable computational problem. Implicit enumeration is a method of solving integer programming problems, by which the optimal solution can be obtained without explicitly evaluating all of the possible solutions. Based on previous studies, we give the DNA computing model that corresponds to the implicit enumeration method using the fluorescent labeling strategy in the framework of surface-based DNA computing. This method has the advantages of simple encoding, low supplies, short operation time, advanced technology etc.
Keywords :
biocomputing; biotechnology; integer programming; molecular biophysics; 0-1 planning; DNA computing; biochemical reaction; biological molecule; biotechnology; fluorescent labeling; implicit enumeration; integer programming; intractable computational problem; Biological information theory; Biological system modeling; Biology computing; Biotechnology; Computational modeling; DNA computing; Encoding; Fluorescence; Labeling; Linear programming; 0-1 programming Problem; DNA Computing; Fluorescence labeling; Implicit Enumeration;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Artificial Intelligence and Computational Intelligence, 2009. AICI '09. International Conference on
Conference_Location :
Shanghai
Print_ISBN :
978-1-4244-3835-8
Electronic_ISBN :
978-0-7695-3816-7
Type :
conf
DOI :
10.1109/AICI.2009.432
Filename :
5376332
Link To Document :
بازگشت