Molecular Computation of Complex Markov Chains with Self-Loop State Transitions

被引:0
作者
Salehi, Sayed Ahmad [1 ]
Riedel, Marc D. [2 ]
Parhi, Keshab K. [2 ]
机构
[1] Utah Valley Univ, Dept Comp Sci & Comp Engn, Orem, UT 84058 USA
[2] Univ Minnesota, Dept Elect & Comp Engn, Minneapolis, MN USA
来源
2017 FIFTY-FIRST ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS, AND COMPUTERS | 2017年
基金
美国国家科学基金会;
关键词
Molecular computation; Markov chain; self-loop state transition; molecular reaction; DNA strand-displacement; DNA; GATES;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper describes a systematic method for molecular implementation of complex Markov chain processes with self-loop transitions. Generally speaking, Markov chains consist of two parts: a set of states, and state transition probabilities. Each state is modeled by a unique molecular type, referred to as a data molecule. Each state transition is modeled by a unique molecular type, referred to as a control molecule, and a unique molecular reaction. Each reaction consumes data molecules of one state and produces data molecules of another state. As we show in this paper, the produced data molecules are the same as the reactant data molecules for self-loop transitions. Although the reactions corresponding to self-loop transitions do not change the molecular concentrations of the data molecules, they are required in order for the system to compute probabilities correctly. The concentrations of control molecules are initialized according to the probabilities of corresponding state transitions in the chain. The steady-state probability of Markov chain is computed by equilibrium concentration of data molecules. We demonstrate our method for a molecular design of a seven-state Markov chain as an instance of a complex Markov chain process with self-loop state transitions. The molecular reactions are then mapped to DNA strand displacement reactions. Using the designed DNA system we compute the steady-state probability matrix such that its element (i,j) corresponds to the long-term probability of staying in state j, given it starts from state i. For example, the error in the computed probabilities is shown to be less than 2% for DNA strand-displacement reactions.
引用
收藏
页码:478 / 483
页数:6
相关论文
共 24 条
[1]   MOLECULAR COMPUTATION OF SOLUTIONS TO COMBINATORIAL PROBLEMS [J].
ADLEMAN, LM .
SCIENCE, 1994, 266 (5187) :1021-1024
[2]   Environmental signal integration by a modular AND gate [J].
Anderson, J. Christopher ;
Voigt, Christopher A. ;
Arkin, Adam P. .
MOLECULAR SYSTEMS BIOLOGY, 2007, 3
[3]   Amplifying Genetic Logic Gates [J].
Bonnet, Jerome ;
Yin, Peter ;
Ortiz, Monica E. ;
Subsoontorn, Pakpoom ;
Endy, Drew .
SCIENCE, 2013, 340 (6132) :599-603
[4]  
Chen Ho-Lin, 2012, Nat Comput, V7433, P25, DOI 10.1007/978-3-642-32208-2_3
[5]   Programmable chemical controllers made from DNA [J].
Chen, Yuan-Jyue ;
Dalchau, Neil ;
Srinivas, Niranjan ;
Phillips, Andrew ;
Cardelli, Luca ;
Soloveichik, David ;
Seelig, Georg .
NATURE NANOTECHNOLOGY, 2013, 8 (10) :755-762
[6]  
Durrett Richard, 2012, ESSENTIALS STOCHASTI
[7]   Efficient exact stochastic simulation of chemical systems with many species and many channels [J].
Gibson, MA ;
Bruck, J .
JOURNAL OF PHYSICAL CHEMISTRY A, 2000, 104 (09) :1876-1889
[8]   GENERAL METHOD FOR NUMERICALLY SIMULATING STOCHASTIC TIME EVOLUTION OF COUPLED CHEMICAL-REACTIONS [J].
GILLESPIE, DT .
JOURNAL OF COMPUTATIONAL PHYSICS, 1976, 22 (04) :403-434
[9]   Making DNA add [J].
Guarnieri, F ;
Fliss, M ;
Bancroft, C .
SCIENCE, 1996, 273 (5272) :220-223
[10]   Discrete-Time Signal Processing with DNA [J].
Jiang, Hua ;
Salehi, Sayed Ahmad ;
Riedel, Marc D. ;
Parhi, Keshab K. .
ACS SYNTHETIC BIOLOGY, 2013, 2 (05) :245-254