Tilings and patterns
Optimal speedup of Las Vegas algorithms
Information Processing Letters
The program-size complexity of self-assembled squares (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Artificial Intelligence - special issue on computational tradeoffs under bounded resources
Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
What is answer set programming?
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Conflict-driven answer set solving
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
DNA origami as self-assembling circuit boards
UC'10 Proceedings of the 9th international conference on Unconventional computation
Programmable Control of Nucleation for Algorithmic Self-Assembly
SIAM Journal on Computing
Synthesizing minimal tile sets for patterned DNA self-assembly
DNA'10 Proceedings of the 16th international conference on DNA computing and molecular programming
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
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
Precise Simulation Model for DNA Tile Self-Assembly
IEEE Transactions on Nanotechnology
Synthesis of Tile Sets for DNA Self-Assembly
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 0.00 |
The Pattern self-Assembly Tile set Synthesis (PATS) problem, which arises in the theory of structured DNA self-assembly, is to determine a set of coloured tiles that, starting from a bordering seed structure, self-assembles to a given rectangular colour pattern. The task of finding minimum-size tile sets is known to be NP-hard. We explore several complete and incomplete search techniques for finding minimal, or at least small, tile sets and also assess the reliability of the solutions obtained according to the kinetic Tile Assembly Model.