A very important area of nanotechnology-self-assembly-is addressed in this paper. It considers several algorithmic approaches (exhaustive branch and bound, heuristics with some relaxed objectives, and answer set programming) to find a minimal (or near minimal) tile set for any pattern. Each algorithm has its own merits and demerits, but there is no discussion on the implementation aspect of the problem.
展开▼
