Constantine Evans from Eric Winfree’s lab talked about theoretical and experimental tile assembly results. The optimal use of the sequences of the sticky ends was important. There are only so many short sequences that are appropriate for sticky ends. You run out of unstructured (linear) combinations of ATGC if you can only have an 8-10 base sequence. If you had infinite, specific partner sequences, you could program tiles to assemble anything, deterministically, just by making each tile a new pixel that only binds its neighbors in an array. But we do not have infinite sequence space. That is why biology does not specify “cell X, Y, Z becomes muscle. Cell X+1, Y+1, Z+1 becomes bone.” In biological development, a cell follows a contingency tree according to the genome and the local stimulus to generate a complex shape. Self assembly might be approached the same way.
Tiles can do that. They can follow simple rules like cellular automata. But errors also propagate. How does one avoid locking in an error? Some sequences are better than others. Different pairs have different sensitivities to sequence issues. This can be used to derive rules for what sticky end pairs are best in a given design. Basically, this is careful analysis of sequence binding and misbinding energy for every sticky end in the system. Careful analysis of misbinding off-rates gives a much better simulation of errors and allows the designer to avoid them.


You must be logged in to post a comment.