Closed circle DNA algorithm for set covering problems

被引:0
|
作者
Zhou, Kang [1 ]
Xie, Zhi [1 ]
Wei, Chuanjia [1 ]
Yi, Xiaowei [1 ]
机构
[1] Department of Mathematics and Physics, Wuhan Polytechnic University, Wuhan 430023, China
关键词
DNA; -; Bioinformatics; Encoding; (symbols);
D O I
暂无
中图分类号
学科分类号
摘要
The computation model for closed circle DNA and its biochemistry experiments were introduced. Set covering and its mathematical model were analyzed. According to the principle that feasible set, covering is composed of these sets, of which an arbitrary element belongs to at least a set, closed circle DNA algorithm of set covering problem was designed. In the closed circle DNA algorithm, two groups of DNA encoding for every 0-1 decision variable of set were encoded according to taking values of variable and cost coefficients corresponding to variable; and all possible solutions were synthesized. All feasible solutions were filtered out by doing insert experiment and delete experiment, and the objective function values of these feasible solutions were obtained by doing insert experiment. And all optimization solutions were filtered out by doing electrophoresis experiment. Finally all optimization solutions were putout by doing detect experiment. An example explained feasibility of the DNA algorithm. Detection experiment based on electrophoresis technique is first put forward, which can detect various kinds of DNA encodings using the experiment order of insert experiment-electrophoresis experiment-group separate experiment.
引用
收藏
页码:21 / 25
相关论文
共 50 条
  • [1] Closed circle DNA algorithm of maximum weighted independent set problem
    Li, Qingyan
    Yin, Zhixiang
    Chen, Min
    [J]. Advances in Intelligent Systems and Computing, 2013, 212 : 113 - 121
  • [2] ALGORITHM FOR SET-COVERING PROBLEMS
    GONDRAN, M
    LAURIERE, JL
    [J]. REVUE FRANCAISE D AUTOMATIQUE INFORMATIQUE RECHERCHE OPERATIONNELLE, 1975, (NV2): : 33 - 51
  • [3] ENHANCING AN ALGORITHM FOR SET COVERING PROBLEMS
    BEASLEY, JE
    JORNSTEN, K
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1992, 58 (02) : 293 - 300
  • [5] Closed circle DNA algorithm of knapsack problem
    Department of Mathematics and Physics, Wuhan Polytechnic University, Wuhan 430023, China
    不详
    [J]. Xitong Fangzhen Xuebao, 2008, 17 (4605-4608):
  • [6] Simulation DNA Algorithm of Set Covering Problem
    Zhou, Kang
    Chen, Jin
    [J]. APPLIED MATHEMATICS & INFORMATION SCIENCES, 2014, 8 (01): : 139 - 144
  • [7] A HEURISTIC ALGORITHM FOR THE MULTICRITERIA SET-COVERING PROBLEMS
    LIU, YH
    [J]. APPLIED MATHEMATICS LETTERS, 1993, 6 (05) : 21 - 23
  • [8] Closed circle DNA algorithm of the maximal matching problem
    Wang, Ming-Chun
    Chen, Chao
    Xu, Rui-Lin
    [J]. PROCEEDINGS OF 2007 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2007, : 3326 - 3330
  • [9] AN O(MN) ALGORITHM FOR REGULAR SET-COVERING PROBLEMS
    BERTOLAZZI, P
    SASSANO, A
    [J]. THEORETICAL COMPUTER SCIENCE, 1987, 54 (2-3) : 237 - 247
  • [10] An ant colony algorithm for solving set-covering problems
    Gao, Yang
    Ge, Hongwei
    [J]. DCABES 2006 PROCEEDINGS, VOLS 1 AND 2, 2006, : 467 - 469