Molecular computing for Markov chains

被引:0
|
作者
Chuan Zhang
Ziyuan Shen
Wei Wei
Jing Zhao
Zaichen Zhang
Xiaohu You
机构
[1] Southeast University,Lab of Efficient Architectures for Digital
[2] Nanjing University,Communication and Signal
来源
Natural Computing | 2020年 / 19卷
关键词
Molecular computing; DNA strand displacement; Markov chain; Mass action kinetics; Gillespie algorithm;
D O I
暂无
中图分类号
学科分类号
摘要
In this paper, it is presented a methodology for implementing arbitrarily constructed time-homogenous Markov chains with biochemical systems. Not only discrete but also continuous-time Markov chains are allowed to be computed. By employing chemical reaction networks as a programmable language, molecular concentrations serve to denote both input and output values. One reaction network is elaborately designed for each chain. The evolution of species’ concentrations over time well matches the transient solutions of the target continuous-time Markov chain, while equilibrium concentrations can indicate the steady state probabilities. Additionally, second-order Markov chains are considered for implementation, with bimolecular reactions rather than unary ones. An original scheme is put forward to compile unimolecular systems to DNA strand displacement reactions for the sake of future physical implementations. Deterministic, stochastic and DNA simulations are provided to enhance correctness, validity and feasibility.
引用
收藏
页码:593 / 608
页数:15
相关论文
共 50 条
  • [1] Molecular computing for Markov chains
    Zhang, Chuan
    Shen, Ziyuan
    Wei, Wei
    Zhao, Jing
    Zhang, Zaichen
    You, Xiaohu
    NATURAL COMPUTING, 2020, 19 (03) : 593 - 608
  • [2] Handling Markov chains with membrane computing
    Cardona, Monica
    Colomer, M. Angels
    Perez-Jimenez, Mario J.
    Zaragoza, Alba
    UNCONVENTIONAL COMPUTATION, PROCEEDINGS, 2006, 4135 : 72 - 85
  • [3] COMPUTING THE DISCOUNTED RETURN IN MARKOV AND SEMI-MARKOV CHAINS
    PORTEUS, EL
    NAVAL RESEARCH LOGISTICS, 1981, 28 (04) : 567 - 577
  • [4] Computing Bounds of the MTTF for a Set of Markov Chains
    Ait-Salaht, F.
    Fourneau, J. M.
    Pekergin, N.
    INFORMATION SCIENCES AND SYSTEMS 2013, 2013, 264 : 67 - 76
  • [5] Computing densities for Markov chains via simulation
    Henderson, SG
    Glynn, PW
    MATHEMATICS OF OPERATIONS RESEARCH, 2001, 26 (02) : 375 - 400
  • [6] Parallel computing for Markov chains with islands and ports
    Basnet, Amod J.
    Sonin, Isaac M.
    ANNALS OF OPERATIONS RESEARCH, 2022, 317 (02) : 335 - 352
  • [7] Parallel computing for Markov chains with islands and ports
    Amod J. Basnet
    Isaac M. Sonin
    Annals of Operations Research, 2022, 317 : 335 - 352
  • [8] Computing the strong Nash equilibrium for Markov chains games
    Clempner, Julio B.
    Poznyak, Alexander S.
    APPLIED MATHEMATICS AND COMPUTATION, 2015, 265 : 911 - 927
  • [9] Computing the extremal index of special Markov chains and queues
    Hooghiemstra, G
    Meester, LE
    STOCHASTIC PROCESSES AND THEIR APPLICATIONS, 1996, 65 (02) : 171 - 185
  • [10] A Recursive Algorithm for Computing Inferences in Imprecise Markov Chains
    T'Joens, Natan
    Krak, Thomas
    De Bock, Jasper
    de Cooman, Gert
    SYMBOLIC AND QUANTITATIVE APPROACHES TO REASONING WITH UNCERTAINTY, ECSQARU 2019, 2019, 11726 : 455 - 465