Flexible versus rigid tile assembly

Authors:
Nataša Jonoska;Gregory L. McColm
Affiliations:
Department of Mathematics, University of South Florida, Tampa, FL;Department of Mathematics, University of South Florida, Tampa, FL
Venue:
UC'06 Proceedings of the 5th international conference on Unconventional Computation
Year:
2006

Citing 4
Cited 3

The program-size complexity of self-assembled squares (extended abstract)

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Computation by Self-assembly of DNA Graphs

Genetic Programming and Evolvable Machines
Self-assembling DNA graphs

Natural Computing: an international journal
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
Describing self-assembly of nanostructures

SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
On aggregation in multiset-based self-assembly of graphs

Natural Computing: an international journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

DNA molecules have been assembled in rigid DX and TX molecules, arrayed in assemblies similar to Wang tiles, and, as flexible branched junction molecules with flexible arms have been used in assemblies representing arbitrary graphs. This paper considers both models of rigid and flexible tiles. A model representing complexes assembled out of rigid tiles based on tile displacements is presented. This presentation is used to simulate computations obtained from (bounded) rigid tile self-assembly by corresponding assemblies of flexible tiles.