Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
The program-size complexity of self-assembled squares (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Running time and program size for self-assembled squares
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Combinatorial optimization problems in self-assembly
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
The emerging discipline of biomolecular computation in the US
New Generation Computing
Algorithmic self-assembly of dna
Algorithmic self-assembly of dna
Invadable self-assembly: combining robustness with efficiency
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Self assembly times in DNA-based computation
ACM SIGMETRICS Performance Evaluation Review
Complexities for Generalized Models of Self-Assembly
SIAM Journal on Computing
CAD/CAM for Nanoscale Self-Assembly
IEEE Computer Graphics and Applications
Design automation for DNA self-assembled nanostructures
Proceedings of the 43rd annual Design Automation Conference
Cooperation through self-assembly in multi-robot systems
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
ICCTA '07 Proceedings of the International Conference on Computing: Theory and Applications
Activation energy-based simulation for self-assembly of multi-shape tiles
Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
Complexity of Self-Assembled Shapes
SIAM Journal on Computing
Toward minimum size self-assembled counters
DNA13'07 Proceedings of the 13th international conference on DNA computing
Complexity of graph self-assembly in accretive systems and self-destructible systems
DNA'05 Proceedings of the 11th international conference on DNA Computing
A self-assembly model of time-dependent glue strength
DNA'05 Proceedings of the 11th international conference on DNA Computing
On the complexity of graph self-assembly in accretive systems
DNA'06 Proceedings of the 12th international conference on DNA Computing
| Hi-index | 0.00 |
The field of algorithmic self-assembly is concerned with the design and analysis of self-assembly systems from a computational perspective, that is, from the perspective of mathematical problems whose study may give insight into the natural processes through which elementary objects self-assemble into more complex ones. One of the main problems of algorithmic self-assembly is the minimum tile set problem, which in the extended formulation we consider, here referred to as MTSP, asks for a collection of types of elementary objects (called tiles) to be found for the self-assembly of an object having a pre-established shape. Such a collection is to be as concise as possible, thus minimizing supply diversity, while satisfying a set of stringent constraints having to do with important properties of the self-assembly process from its tile types. We present a study of what, to the best of our knowledge, is the first practical approach to MTSP. Our study starts with the introduction of an evolutionary heuristic to tackle MTSP and includes selected results from extensive experimentation with the heuristic on the self-assembly of simple objects in two and three dimensions, including the possibility of tile rotation. The heuristic we introduce combines classic elements from the field of evolutionary computation with a problem-specific variant of Pareto dominance into a multi-objective approach to MTSP.