On the computational complexity of tile set synthesis for DNA self-assembly
IEEE Transactions on Circuits and Systems II: Express Briefs
Manufacturing yield of QCA circuits by synthesized DNA self-assembled templates
Proceedings of the 20th symposium on Great lakes symposium on VLSI
A coding framework for DNA self-assembly
NANOARCH '09 Proceedings of the 2009 IEEE/ACM International Symposium on Nanoscale Architectures
Synthesizing minimal tile sets for patterned DNA self-assembly
DNA'10 Proceedings of the 16th international conference on DNA computing and molecular programming
One-dimensional staged self-assembly
DNA'11 Proceedings of the 17th international conference on DNA computing and molecular programming
Synthesizing small and reliable tile sets for patterned DNA self-assembly
DNA'11 Proceedings of the 17th international conference on DNA computing and molecular programming
An introduction to tile-based self-assembly
UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation
One-dimensional staged self-assembly
Natural Computing: an international journal
Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly
Theoretical Computer Science
Search methods for tile sets in patterned DNA self-assembly
Journal of Computer and System Sciences
| Hi-index | 0.04 |
This paper addresses the issues revolving around the synthesis of tile sets for DNA self-assembly as a promising approach for IC manufacturing in the nanoscale. As for a finite pattern, synthesis for minimizing tile or bond types is equivalent to a minimum graph coloring problem, two greedy algorithms that reduce the number of tiles (PATS_Tile) or bonds (PATS_Bond) in synthesized tile sets are proposed and evaluated. Both algorithms are O(l4) for a square pattern of dimension l. It is shown by simulation that PATS_Tile has a better average performance if both types of reduction must be accomplished.