Efficient algorithms for self assembling non-rectangular nano structures

DOI10.1007/S11047-010-9210-4MaRDI QIDQ537839zbMATH OpenOpenAlexFDO

Authors 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

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)

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

Cites work

• scientific article; zbMATH DE number 1568804 (Why is no real title available?)
• Complexities for Generalized Models of Self-Assembly
• Complexity of Self‐Assembled Shapes
• Randomized Self-assembly for Approximate Shapes
• Reducing tile complexity for self-assembly through temperature programming
• Running time and program size for self-assembled squares
• The program-size complexity of self-assembled squares (extended abstract)

Cited in

(3)

• Modeling through self-assembly
• scientific article; zbMATH DE number 2081010 (Why is no real title available?)
• Randomized Self Assembly of Rectangular Nano Structures

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)