Closed circle DNA algorithm of the maximal matching problem

被引：0
|
作者：
Wang, Ming-Chun [1 ]
Chen, Chao [1 ]
Xu, Rui-Lin [1 ]
机构：
[1] Tianjin Univ Technol & Educ, Coll Math & Phys, Tianjin 300222, Peoples R China
来源：
PROCEEDINGS OF 2007 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7 | 2007年
关键词：
model of closed circle DNA computing; Maximal matching; NP-complete problem;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
This paper proposes a DNA algorithm based on the closed circle DNA for the maximal matching problem. First, the basic biochemistry experiments are given. Then, the matching problem is solved directly through a delete experiment. Lastly, the maximal matching is obtained through an electrophoresis experiment. Since only basic biochemistry experiments are utilized in the proposed algorithm, so the presented method is simple and credible.
引用
收藏
页码：3326 / 3330
页数：5
相关论文
共 50 条
12345