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 条
  • [31] A novel computing model of the maximum clique problem based on circular DNA
    Yang Jing
    Zhang Cheng
    Xu Jin
    Liu XiangRong
    Qiang XiaoLi
    SCIENCE CHINA-INFORMATION SCIENCES, 2010, 53 (07) : 1409 - 1416
  • [32] A novel computing model of the maximum clique problem based on circular DNA
    Jing Yang
    Cheng Zhang
    Jin Xu
    XiangRong Liu
    XiaoLi Qiang
    Science China Information Sciences, 2010, 53 : 1409 - 1416
  • [33] A SHRINKING CHAOTIC MAXIMUM NEURAL NETWORK FOR MAXIMUM CLIQUE PROBLEM
    Yi, Junyan
    Yang, Gang
    Gao, Shangce
    Tang, Zheng
    INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2009, 5 (05): : 1213 - 1229
  • [34] An Improved Chaotic Maximum Neural Network for Maximum Clique Problem
    Yang, Gang
    Tang, Zheng
    Yi, Junyan
    INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2007, 7 (02): : 1 - 7
  • [35] Solving the maximum clique problem using PUBB
    Shinano, Y
    Fujie, T
    Ikebe, Y
    Hirabayashi, R
    FIRST MERGED INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM & SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING, 1998, : 326 - 332
  • [36] The Maximum Clique Problem for Permutation Hamming Graphs
    János Barta
    Roberto Montemanni
    Journal of Optimization Theory and Applications, 2022, 194 : 492 - 507
  • [37] Dynamic local search for the maximum clique problem
    Pullan, W
    Hoos, HH
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2006, 25 (159-185): : 159 - 185
  • [38] A New Genetic Algorithm for the Maximum Clique Problem
    Evin, Gozde Kizilates
    ARTIFICIAL INTELLIGENCE AND APPLIED MATHEMATICS IN ENGINEERING PROBLEMS, 2020, 43 : 766 - 774
  • [39] Subgraph extraction and metaheuristics for the maximum clique problem
    Duc-Cuong Dang
    Aziz Moukrim
    Journal of Heuristics, 2012, 18 : 767 - 794
  • [40] An exact algorithm for the maximum probabilistic clique problem
    Miao, Zhuqi
    Balasundaram, Balabhaskar
    Pasiliao, Eduardo L.
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2014, 28 (01) : 105 - 120