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
来源
基金
中国国家自然科学基金;
关键词
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 条
  • [1] Sticker model for maximum clique problem and maximum independent set
    Fan Y.-K.
    Qiang X.-L.
    Xu J.
    Jisuanji Xuebao/Chinese Journal of Computers, 2010, 33 (02): : 305 - 310
  • [2] Sticker model-based DNA algorithm of maximum clique problem
    Zhou, Kang
    Liu, Shuo
    Qin, Lei
    Yi, Xiaowei
    Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition), 2010, 38 (09): : 89 - 92
  • [3] A recursive molecular sticker algorithm for the maximal clique problem
    Geng, Xiutang
    Xiao, Jianhua
    Xu, Jin
    JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2007, 4 (7-8) : 1253 - 1256
  • [4] A New Solution for Maximal Clique Problem based Sticker Model
    Darehmiraki, Majid
    BIOSYSTEMS, 2009, 95 (02) : 145 - 149
  • [5] Molecular beacon computing model for maximum weight clique problem
    Yin, Zhixiang
    Cui, Jianzhong
    Zhen, Chen
    MATHEMATICS AND COMPUTERS IN SIMULATION, 2018, 151 : 147 - 155
  • [6] A Molecular Computing Model for Maximum Clique Problem Based on DNA Nanoparticles
    Shen Lingjing
    Song Zhichao
    Wu Liuqing
    Dong Yafei
    JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2014, 11 (10) : 2120 - 2124
  • [7] Maximum clique problem
    1600, (04):
  • [8] THE MAXIMUM CLIQUE PROBLEM
    PARDALOS, PM
    XUE, J
    JOURNAL OF GLOBAL OPTIMIZATION, 1994, 4 (03) : 301 - 328
  • [9] Molecular Beacon-based DNA computing model for Maximum weight clique problem
    Yin, Zhixiang
    Cui, Jianzhong
    2009 FOURTH INTERNATIONAL CONFERENCE ON BIO-INSPIRED COMPUTING: THEORIES AND APPLICATIONS, PROCEEDINGS, 2009, : 84 - 87
  • [10] An algorithm in tile assembly model for maximum clique problem
    Li, Kenli
    Luo, Xing
    Wu, Fan
    Zhou, Xu
    Huang, Xin
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2013, 50 (03): : 666 - 675