Skip to main content
. Author manuscript; available in PMC: 2014 Nov 27.
Published in final edited form as: Nat Commun. 2014 May 27;5:4002. doi: 10.1038/ncomms5002

Figure 3.

Figure 3

Computational candidates generated for one round of the CYC1 promoter redesign. Each candidate queried for the CYC1 promoter redesign was plotted for the first round of A) a greedy algorithm searching over all possible single base pair changes per round and B) a greedy algorithm searching over all possible double base pair changes per round. For the algorithm searching over all single base pair changes, known transcription factor binding sites, TATA boxes, and transcription start sites are annotated. For the algorithm searching over all pairs, each point on the surface represents the most favorable pair of mutations (out of 16 possibilities) for a particular pair of positions.