Time Optimal Self-assembly for 2D and 3D Shapes: The Case of Squares and Cubes. - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

Time Optimal Self-assembly for 2D and 3D Shapes: The Case of Squares and Cubes.

Résumé

We refine the current notion of time in self-assembly, and show constructions which are time- optimal, not only up to a constant. For this, we refine the notion of time-complexity of an assembly, to separate the influence of the concentrations from the intrinsic speed of the assembly. We give a time-optimal construction for the square. A formulation of tile-sets in terms of time allows us to build an optimal system for 3D-cubes.

Dates et versions

inria-00448556 , version 1 (19-01-2010)

Identifiants

Citer

Florent Becker, Éric Rémila, Nicolas Schabanel. Time Optimal Self-assembly for 2D and 3D Shapes: The Case of Squares and Cubes.. 14th International Meeting on DNA Computing, Jun 2008, Prague, Czech Republic. pp.0, ⟨10.1007/978-3-642-03076-5⟩. ⟨inria-00448556⟩
93 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More