Synthesizing Minimal Tile Sets for Patterned DNA Self-assembly
The Pattern self-Assembly Tile set Synthesis (PATS) problem is to determine a set of coloured tiles that self-assemble to implement a given rectangular colour pattern. We give an exhaustive branch-and-bound algorithm to find tile sets of minimum cardinality for the PATS problem. Our algorithm makes use of a search tree in the lattice of partitions of the ambient rectangular grid, and an efficient bounding function to prune this search tree. Empirical data on the performance of the algorithm shows that it compares favourably to previously presented heuristic solutions to the problem.
Unable to display preview. Download preview PDF.
- 1.Adleman, L., Cheng, Q., Goel, A., Huang, M.-D., Kempe, D., de Espanés, P.M., Rothemund, P.W.K.: Combinatorial optimization problems in self-assembly. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC 2002), pp. 23–32. ACM, New York (2002)Google Scholar
- 2.Göös, M., Orponen, P.: Synthesizing minimal tile sets for patterned DNA self-assembly. A detailed version, arXiv:0911.2924Google Scholar
- 4.Lin, C., Liu, Y., Rinker, S., Yan, H.: DNA tile based self-assembly: building complex nanoarchitectures. Chem. Phys. Chem. 7(8), 1641–1647 (2006)Google Scholar
- 9.Rothemund, P.W.K.: Theory and Experiments in Algorithmic Self-assembly. PhD thesis, University of Southern California (2001)Google Scholar
- 11.Rothemund, P.W.K., Winfree, E.: The program-size complexity of self-assembled squares (extended abstract). In: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC 2000), pp. 459–468. ACM, New York (2000)Google Scholar
- 12.Winfree, E.: Algorithmic Self-Assembly of DNA. PhD thesis, California Institute of Technology (1998)Google Scholar