Complexity classes for self-assembling flexible tiles

Authors:
Nataa Jonoska;Gregory L. McColm
Affiliations:
Department of Mathematics, University of South Florida, Tampa, FL 33620, United States;Department of Mathematics, University of South Florida, Tampa, FL 33620, United States
Venue:
Theoretical Computer Science
Year:
2009

Citing 14
Cited 3

Molecular computation of solutions to combinatorial problems

Science
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
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
On the Decidability of Self-Assembly of Infinite Ribbons

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Computation by Self-assembly of DNA Graphs

Genetic Programming and Evolvable Machines
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Complexity of Self-Assembled Shapes

SIAM Journal on Computing
On the complexity of graph self-assembly in accretive systems

Natural Computing: an international journal
Flexible versus rigid tile assembly

UC'06 Proceedings of the 5th international conference on Unconventional Computation
Expectation and variance of self-assembled graph structures

DNA'05 Proceedings of the 11th 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 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

On stoichiometry for the assembly of flexible tile DNA complexes

Natural Computing: an international journal
Programming and evolving physical self-assembling systems in three dimensions

Natural Computing: an international journal
Graph-theoretic formalization of hybridization in DNA sticker complexes

Natural Computing: an international journal

Quantified Score

Hi-index	5.23

Visualization

Abstract

We present a theoretical model for self-assembling DNA tiles with flexible branches. We encode an instance of a ''problem'' as a pot of such tiles for which a ''solution'' is an assembled complete complex without any free sticky ends. Using the number of tiles in an assembled complex as a measure of complexity we show how NTIME classes (such as NP and NEXP) can be represented with corresponding classes of the model.