Design and analysis of DNA strand displacement devices using probabilistic model checking by Matthew R. Lakin, David Parker, Luca Cardelli, Marta Kwiatkowska,
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Design and analysis of DNA strand displacement devices using probabilistic model checking
by Matthew R. Lakin, David Parker, Luca Cardelli, Marta Kwiatkowska, and Andrew Phillips
Plot showing expected percentage of leftover reactive gates in the final state of the system against the number of parallel buggy transducers—that is, the parameter N in the system
S(N,x0)| T(N,x0,x1)| T(N,x1,x2).
Matthew R. Lakin et al. J. R. Soc. Interface 2012;9:1470-1485
Plot showing the expected time to terminate for chains of corrected transducer gates; that is, we vary the parameter k in the system S(1,x0)| T2(1,x0,x1)| . . .| T2(1,x{ k − 1} ,xk).
Matthew R. Lakin et al. J. R. Soc. Interface 2012;9:1470-1485
Plot of expected time to completion for N parallel copies of catalyst gates with (solid line with filled circles) and without (solid line with filled triangle) garbage collection.
Matthew R. Lakin et al. J. R. Soc. Interface 2012;9:1470-1485
DNA strand displacement (DSD) code for a catalyst gate, which extends the C_NoGC gate from figure 9 by using the constant keyword from the DSD language to abstract away from population
changes due to accumulation of waste and depletion of fuel.
Matthew R. Lakin et al. J. R. Soc. Interface 2012;9:1470-1485
Probability of reaching a consensus of X, plotted against (X0 − Y0 )/N, which is the difference between the initial populations of X and Y, relative to the total initial population N = X0 + Y0 .
Matthew R. Lakin et al. J. R. Soc. Interface 2012;9:1470-1485