Efficient algorithms for self assembling non-rectangular nano structures

DOI10.1007/S11047-010-9210-4zbMATH Open1214.68178OpenAlexW2051166566MaRDI QIDQ537839FDOQ537839

Sanguthevar Rajasekaran, Vamsi Krishna Kundeti

Publication date: 23 May 2011

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-010-9210-4

Recommendations

• Algorithmic DNA Self-assembly
• scientific article; zbMATH DE number 2081010
• Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O(1) Glues
• Randomized Self Assembly of Rectangular Nano Structures
• Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues

zbMATH Keywords

algorithmic self assemblybiomolecular self assemblynano structures

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Combinatorial aspects of tessellation and tiling problems (05B45)

Cites Work

• The program-size complexity of self-assembled squares (extended abstract)
• Randomized Self-assembly for Approximate Shapes
• Running time and program size for self-assembled squares
• Complexities for Generalized Models of Self-Assembly
• Complexity of Self‐Assembled Shapes
• Reducing tile complexity for self-assembly through temperature programming
• Title not available (Why is that?)

Cited In (2)

• Randomized Self Assembly of Rectangular Nano Structures
• Title not available (Why is that?)

This page was built for publication: Efficient algorithms for self assembling non-rectangular nano structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q537839)