Molecular Sticker Model Stimulation on Silicon for a Maximum Clique Problem

被引:2
|
作者
Ning, Jianguo [1 ]
Li, Yanmei [1 ]
Yu, Wen [2 ]
机构
[1] Beijing Inst Technol, State Key Lab Explos Sci & Technol, Beijing 100081, Peoples R China
[2] Beijing Univ Posts & Telecommun, Beijing Key Lab Intelligent Telecommun Software &, Beijing 100876, Peoples R China
来源
INTERNATIONAL JOURNAL OF MOLECULAR SCIENCES | 2015年 / 16卷 / 06期
基金
中国国家自然科学基金;
关键词
STRAND DISPLACEMENT CASCADES; 3-SAT PROBLEM; DNA SOLUTION; COMPUTATION; ALGORITHMS; MACHINE;
D O I
10.3390/ijms160613474
中图分类号
Q5 [生物化学]; Q7 [分子生物学];
学科分类号
071010 ; 081704 ;
摘要
Molecular computers (also called DNA computers), as an alternative to traditional electronic computers, are smaller in size but more energy efficient, and have massive parallel processing capacity. However, DNA computers may not outperform electronic computers owing to their higher error rates and some limitations of the biological laboratory. The stickers model, as a typical DNA-based computer, is computationally complete and universal, and can be viewed as a bit-vertically operating machine. This makes it attractive for silicon implementation. Inspired by the information processing method on the stickers computer, we propose a novel parallel computing model called DEM (DNA Electronic Computing Model) on System-on-a-Programmable-Chip (SOPC) architecture. Except for the significant difference in the computing medium-transistor chips rather than bio-molecules-the DEM works similarly to DNA computers in immense parallel information processing. Additionally, a plasma display panel (PDP) is used to show the change of solutions, and helps us directly see the distribution of assignments. The feasibility of the DEM is tested by applying it to compute a maximum clique problem (MCP) with eight vertices. Owing to the limited computing sources on SOPC architecture, the DEM could solve moderate-size problems in polynomial time.
引用
收藏
页码:13474 / 13489
页数:16
相关论文
共 50 条
  • [41] A BRANCH AND BOUND ALGORITHM FOR THE MAXIMUM CLIQUE PROBLEM
    PARDALOS, PM
    RODGERS, GP
    COMPUTERS & OPERATIONS RESEARCH, 1992, 19 (05) : 363 - 375
  • [42] The Maximum Clique Problem in Multiple Interval Graphs
    Francis, Mathew C.
    Goncalves, Daniel
    Ochem, Pascal
    ALGORITHMICA, 2015, 71 (04) : 812 - 836
  • [43] Parallel Bounded Search for the Maximum Clique Problem
    Jiang, Hua
    Bai, Ke
    Liu, Hai-Jiao
    Li, Chu-Min
    Manya, Felip
    Fu, Zhang-Hua
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2023, 38 (05) : 1187 - 1202
  • [44] A Scatter Search algorithm for the Maximum Clique Problem
    Cavique, L
    Rego, C
    Themido, I
    ESSAYS AND SURVEYS IN METAHEURISTICS, 2002, 15 : 227 - 244
  • [45] A complete resolution of the Keller maximum clique problem
    Debroni, Jennifer
    Eblen, John D.
    Langston, Michael A.
    Myrvold, Wendy
    Shor, Peter
    Weerapurage, Dinesh
    PROCEEDINGS OF THE TWENTY-SECOND ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2011, : 129 - 135
  • [46] Improvements to MCS algorithm for the maximum clique problem
    Mikhail Batsyn
    Boris Goldengorin
    Evgeny Maslov
    Panos M. Pardalos
    Journal of Combinatorial Optimization, 2014, 27 : 397 - 416
  • [47] An exact algorithm for the maximum probabilistic clique problem
    Zhuqi Miao
    Balabhaskar Balasundaram
    Eduardo L. Pasiliao
    Journal of Combinatorial Optimization, 2014, 28 : 105 - 120
  • [48] Cooperating local search for the maximum clique problem
    Pullan, Wayne
    Mascia, Franco
    Brunato, Mauro
    JOURNAL OF HEURISTICS, 2011, 17 (02) : 181 - 199
  • [49] On a continuous approach for the maximum weighted clique problem
    Gruzdeva, Tatyana V.
    JOURNAL OF GLOBAL OPTIMIZATION, 2013, 56 (03) : 971 - 981
  • [50] Incremental Upper Bound for the Maximum Clique Problem
    Li, Chu-Min
    Fang, Zhiwen
    Jiang, Hua
    Xu, Ke
    INFORMS JOURNAL ON COMPUTING, 2018, 30 (01) : 137 - 153