Engineering bacteria to solve the Burnt Pancake Problem-4

The possible eight starting permutations is a state (shown in parenthesis in the graph). At each step (Number of flips ()) in a random walk on the graph in Figure 1b, the probability of a plasmid being properly sorted (% Plasmids that solved the problem) after flips is calculated as the number of paths of length from the initial state to the solution state, divided by the total number of paths of length from the initial state to any state. Starting permutations that show equivalent behavior can be grouped into three families (distinguished by color in the graph). The families are distinguishable for up to 4 flips; at 5 flips and beyond they reach a state of equilibrium at 25% plasmids solved.Copyright information:Taken from "Engineering bacteria to solve the Burnt Pancake Problem"http://www.jbioleng.org/content/2/1/8Journal of Biological Engineering 2008;2():8-8.Published online 20 May 2008PMCID:PMC2427008.