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
Expectation and variance of self-assembled graph structures
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
A computational model for self-assembling flexible tiles
UC'05 Proceedings of the 4th international conference on Unconventional Computation
Complexity classes for self-assembling flexible tiles
Theoretical Computer Science
A comparison of graph-theoretic DNA hybridization models
Theoretical Computer Science
| Hi-index | 0.00 |
Given a set of flexible branched junction DNA molecules (building blocks) with sticky ends we consider the question of determining the proper stoichiometry such that all sticky ends could end up connected. The idea is to determine the proper proportion (spectrum) of each type of molecules present, which in general is not uniform. We classify the pot in three classes: weakly satisfiable, satisfiable and strongly satisfiable according to possible components that assemble in complete complexes. This classification is characterized through the spectrum of the pot, which can be computed in PTIME using the standard Gauss-Jordan elimination method.