Approaching mathematical model of the immune network based DNA Strand Displacement system

Biosystems ◽  
2013 ◽  
Vol 114 (3) ◽  
pp. 245-252 ◽  
Author(s):  
Rizki Mardian ◽  
Kosuke Sekiyama ◽  
Toshio Fukuda
Nanoscale ◽  
2016 ◽  
Vol 8 (19) ◽  
pp. 10087-10095 ◽  
Author(s):  
H. D. Gliddon ◽  
P. D. Howes ◽  
M. Kaforou ◽  
M. Levin ◽  
M. M. Stevens

On the development of a novel multiplexed assay for Tuberculosis-specific mRNA detection using DNA strand displacement and quantum dots.


2011 ◽  
Vol 9 (68) ◽  
pp. 470-486 ◽  
Author(s):  
Matthew R. Lakin ◽  
Simon Youssef ◽  
Luca Cardelli ◽  
Andrew Phillips

DNA strand displacement techniques have been used to implement a broad range of information processing devices, from logic gates, to chemical reaction networks, to architectures for universal computation. Strand displacement techniques enable computational devices to be implemented in DNA without the need for additional components, allowing computation to be programmed solely in terms of nucleotide sequences. A major challenge in the design of strand displacement devices has been to enable rapid analysis of high-level designs while also supporting detailed simulations that include known forms of interference. Another challenge has been to design devices capable of sustaining precise reaction kinetics over long periods, without relying on complex experimental equipment to continually replenish depleted species over time. In this paper, we present a programming language for designing DNA strand displacement devices, which supports progressively increasing levels of molecular detail. The language allows device designs to be programmed using a common syntax and then analysed at varying levels of detail, with or without interference, without needing to modify the program. This allows a trade-off to be made between the level of molecular detail and the computational cost of analysis. We use the language to design a buffered architecture for DNA devices, capable of maintaining precise reaction kinetics for a potentially unbounded period. We test the effectiveness of buffered gates to support long-running computation by designing a DNA strand displacement system capable of sustained oscillations.


Biosystems ◽  
2014 ◽  
Vol 115 ◽  
pp. 5-12 ◽  
Author(s):  
Alfonso Rodríguez-Patón ◽  
Iñaki Sainz de Murieta ◽  
Petr Sosík

2017 ◽  
Vol 121 (12) ◽  
pp. 2594-2602 ◽  
Author(s):  
Xiaoping Olson ◽  
Shohei Kotani ◽  
Bernard Yurke ◽  
Elton Graugnard ◽  
William L. Hughes

ChemPhysChem ◽  
2021 ◽  
Author(s):  
Hui Lv ◽  
Qian Li ◽  
Jiye Shi ◽  
Fei Wang ◽  
Chunhai Fan

Nano Letters ◽  
2021 ◽  
Vol 21 (3) ◽  
pp. 1368-1374
Author(s):  
Jinbo Zhu ◽  
Filip Bošković ◽  
Bao-Nguyen T. Nguyen ◽  
Jonathan R. Nitschke ◽  
Ulrich F. Keyser

Talanta ◽  
2019 ◽  
Vol 200 ◽  
pp. 487-493 ◽  
Author(s):  
Raja Chinnappan ◽  
Rawa Mohammed ◽  
Ahmed Yaqinuddin ◽  
Khalid Abu-Salah ◽  
Mohammed Zourob

2015 ◽  
Vol 58 (10) ◽  
pp. 1515-1523 ◽  
Author(s):  
Yafei Dong ◽  
Chen Dong ◽  
Fei Wan ◽  
Jing Yang ◽  
Cheng Zhang

Sign in / Sign up

Export Citation Format

Share Document