Skip to main content
. 2012 Jan 4;9(72):1470–1485. doi: 10.1098/rsif.2011.0800

Figure 16.

Figure 16.

Elementary reduction rules of the DSD programming language. We let S denote the migration rate of a domain sequence S and fst(S) denote its first domain. We also let N+ and N − denote the binding and unbinding rates, respectively, of a toehold N. We assume that fst(R2) ≠ fst(S2) for rule (RM). This ensures that branch migration is maximal along a given sequence and that rules (RM) and (RD) are mutually exclusive. (Online version in colour.)