Solve the partitioning problem by sticker model in DNA computing
The aim of this work is to solve the partitioning problem, the most canonical NP-complete problem containing numerical parameters, within the sticker model of DNA computing. We firstly design a parallel program for addition, and then give a program to calculate the subset sums of a set. At last, a program for partitioning is given, which contains the former programs. Furthermore, the correctness of each program is proved in this paper.
作 者： QU Huiqin Lu Mingming ZHU Hong 作者单位： Intelligent Information Processing Laboratory, Fudan University, Shanghai 200437, China 刊 名： 自然科学进展（英文版） SCI 英文刊名： PROGRESS IN NATURAL SCIENCE 年，卷(期)： 2004 14(12) 分类号： Q3 关键词： sticker model partition memory complex