Error suppression mechanisms for DNA tile self-assembly and their simulation

DOI10.1007/S11047-008-9093-9zbMath1192.68825OpenAlexW2105219493WikidataQ59328956 ScholiaQ59328956MaRDI QIDQ734204

Satoshi Murata, David Yu Zhang, Kenichi Fujibayashi, Erik Winfree

Publication date: 19 October 2009

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

Full work available at URL: https://doi.org/10.1007/s11047-008-9093-9

zbMATH Keywords

DNA self-assemblyAlgorithmic self-assemblyAssembly errorsBranch migrationProtecting molecules

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (5)

Efficient 3-SAT algorithms in the tile assembly model ⋮ On the scalability of biocomputing algorithms: the case of the maximum clique problem ⋮ Distributed agreement in tile self-assembly ⋮ Activatable tiles for compact robust programmable molecular assembly and other applications ⋮ An introduction to tile-based self-assembly and a survey of recent results

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The program-size complexity of self-assembled squares (extended abstract)
• Self-correcting Self-assembly: Growth Models and the Hammersley Process
• Running time and program size for self-assembled squares
• Complexity of Self‐Assembled Shapes
• Capabilities and Limits of Compact Error Resilience Methods for Algorithmic Self-assembly in Two and Three Dimensions
• DNA Computing
• DNA Computing
• DNA Computing
• DNA Computing
• DNA Computing

This page was built for publication: Error suppression mechanisms for DNA tile self-assembly and their simulation