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  

【Solve the partitioning problem by st】相關文章：

No problem. 沒問題.05-04

Inverse minimum spanning tree problem and reverse shortest-path problem with discrete values04-26

Partitioning series-parallel multigraphs into υ*-excluding edge covers04-28

THE PROBLEM OF AN EXTERNAL CIRCULAR CRACK UNDER ASYMMETRIC LOADINGS04-28

An Interval Maximum Entropy Method for Quadratic Programming Problem04-29

讓S*ST張股恢復迷人原貌04-28

The generalized solution of ill-posed boundary problem04-28

(r,s)-STABILITY OF UNFOLDING OF Γ-EQUIVARIANT BIFURCATION PROBLEM04-28

How Does the Partitioning of Evapotranspiration and Runoff between Different Processes Affect the Variability and Predic04-27

ST德棉：業績快報整改報告04-27