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
On the Decidability of Self-Assembly of Infinite Ribbons
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
DNA Self-Assembly For Constructing 3D Boxes
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Computation by Self-assembly of DNA Graphs
Genetic Programming and Evolvable Machines
Complexity classes for self-assembling flexible tiles
Theoretical Computer Science
On stoichiometry for the assembly of flexible tile DNA complexes
Natural Computing: an international journal
A computational model for self-assembling flexible tiles
UC'05 Proceedings of the 4th international conference on Unconventional Computation
Spectrum of a pot for DNA complexes
DNA'06 Proceedings of the 12th international conference on DNA Computing
| Hi-index | 0.00 |
Understanding how nanostructures are self-assembled into more complex forms is a crucial component of nanotechnology that shall lead towards understanding other processes and structures in nature. In this paper we use a model of self-assembly using flexible junction molecules and describe how it can in some static conditions be used to predict the outcome of a graph self-assembly. Using probabilistic methods, we show the expectation and the variance of the number of self-assembled cycles, K3, and discuss generalization of these results for Cn. We tie this analysis to previously observed experimental results.