Application of DNA Computing by Self-assembly on 0-1 Knapsack Problem

Authors:
Guangzhao Cui;Cuiling Li;Xuncai Zhang;Yanfeng Wang;Xinbo Qi;Xiaoguang Li;Haobin Li
Affiliations:
Henan Key Lab of Information-based Electrical Appliances, Zhengzhou, China 450002;Henan Key Lab of Information-based Electrical Appliances, Zhengzhou, China 450002;Henan Key Lab of Information-based Electrical Appliances, Zhengzhou, China 450002 and Department of Control Science and Engineering, Huazhong University of Science and Technology, Wuhan, China 430 ...;Henan Key Lab of Information-based Electrical Appliances, Zhengzhou, China 450002;Henan Mechanical and Electrical Engineering College, Xinxiang, China 153000;Henan Key Lab of Information-based Electrical Appliances, Zhengzhou, China 450002;Henan Key Lab of Information-based Electrical Appliances, Zhengzhou, China 450002
Venue:
ISNN 2009 Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III
Year:
2009

Citing 8
Cited 0

Molecular computation of solutions to combinatorial problems

Science
Challenges and Applications for Self-Assembled DNA Nanostructures

DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
String Tile Models for DNA Computing by Self-Assembly

DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
DNA computing by blocking

Theoretical Computer Science - Algorithms,automata, complexity and games
Algorithmic self-assembly of dna

Algorithmic self-assembly of dna
Arithmetic computation in the tile assembly model: Addition and multiplication

Theoretical Computer Science
Nondeterministic polynomial time factoring in the tile assembly model

Theoretical Computer Science
Solving NP-complete problems in the tile assembly model

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Computation by self-assembly of DNA is an efficient method of executing parallel DNA computing where information is encoded in DNA tiles and a large number of tiles can be self-assembled via sticky-end associations. It presents clear evidence of the ability of molecular computing to perform complicated mathematical operations. We investigate how basic ideas on tiling can be applied to solving knapsack problem. It suggests that these procedures can be realized on the molecular scale through the medium of self-assembled DNA tiles. The potential of DNA computing by self-assembly for the knapsack problem is promising given the operational time complexity of *** (n ).