an:05842530
Zbl 1309.68210
G????s, Mika; Orponen, Pekka
Synthesizing minimal tile sets for patterned DNA self-assembly
EN
Sakakibara, Yasubumi (ed.) et al., DNA computing and molecular programming. 16th international conference, DNA 16, Hong Kong, China, June 14--17, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-18304-1/pbk). Lecture Notes in Computer Science 6518, 71-82 (2011).
2011
a
68W05 68P05 68R05 68T20
Summary: 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.
For the entire collection see [Zbl 1205.68022].