Annals of Operations Research - Special issue on Tabu search
Protein folding in the hydrophobic-hydrophilic (HP) is NP-complete
RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
The program-size complexity of self-assembled squares (extended abstract)
STOC '00 Proceedings of the thirty-second 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
A new kind of science
Polar IFS+Parisian Genetic Programming=Efficient IFS Inverse Problem Solving
Genetic Programming and Evolvable Machines
Evolving l-systems to capture protein structure native conformations
EuroGP'05 Proceedings of the 8th European conference on Genetic Programming
Protein folding with cellular automata in the 3D HP model
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Hi-index | 0.00 |
The automated design of systems which self-assemble is a fundamental cornerstone of nanotechnology. In this paper we review some work in which we have applied Evolutionary Algorithms (EAs) for the automated design of systems self-assembly. We will focus in three important minimalist self-assembly problems and we discuss the difficulties encountered while applying EAs to these test cases. We also suggest some promising lines of work that could possibly help overcome current limitations in the evolutionary design of self-assembling systems.