Two computational primitives for algorithmic self-assembly: copying and counting.

@article{Barish2005TwoCP,
  title={Two computational primitives for algorithmic self-assembly: copying and counting.},
  author={Robert D. Barish and Paul W. K. Rothemund and Erik Winfree},
  journal={Nano letters},
  year={2005},
  volume={5 12},
  pages={2586-92}
}
Copying and counting are useful primitive operations for computation and construction. We have made DNA crystals that copy and crystals that count as they grow. For counting, 16 oligonucleotides assemble into four DNA Wang tiles that subsequently crystallize on a polymeric nucleating scaffold strand, arranging themselves in a binary counting pattern that could serve as a template for a molecular electronic demultiplexing circuit. Although the yield of counting crystals is low, and per-tile… CONTINUE READING