A new molecular computing algorithm based on signaling pathways: Solving 3-SAT (50,30) problem with the cost of linear space complexity

被引:0
|
作者
Liu, JQ [1 ]
Shimohara, K [1 ]
机构
[1] ATR Int, Human Informat Sci Labs, Kyoto, Japan
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Reducing the huge number of bio-molecules used for building molecular computers is one of the most crucial and imperative tasks in the molecular computing field. Inspired by biological signaling pathways in cells, a formal-system-based algorithm for spatially efficient molecular computing by pathways is proposed in this paper. Its space complexity is O(mxn) and its time complexity is O(m) when the algorithm is applied to solving 3-SAT problems, where in is the number of clauses and m is the number of variables. The experimental result obtained from the corresponding software implementation of the algorithm shows that the algorithm is efficient from the aspect of cost of computing and practical in its biological faithfulness.
引用
收藏
页码:594 / 597
页数:4
相关论文
共 2 条
  • [1] Signaling-pathway-based molecular computing for efficient 3-SAT problem solving
    Liu, JQ
    Shimohara, K
    INFORMATION SCIENCES, 2004, 161 (3-4) : 121 - 137
  • [2] Solving the 3-SAT problem based on DNA computing
    Liu, WB
    Gao, L
    Liu, XR
    Wang, SD
    Xu, J
    JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES, 2003, 43 (06): : 1872 - 1875