Self-correcting Self-assembly: Growth Models and the Hammersley Process

DOI10.1007/11753681_1zbMath1234.68106OpenAlexW1513479208MaRDI QIDQ3618676

Teddy Yimwadsana, Nadrian C. Seeman, Yuliy M. Baryshnikov, Edward G. jun. Coffman

Publication date: 2 April 2009

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

Full work available at URL: https://doi.org/10.1007/11753681_1

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (5)

Arithmetic computation in the tile assembly model: addition and multiplication ⋮ Nondeterministic polynomial time factoring in the tile assembly model ⋮ Solving NP-complete problems in the tile assembly model ⋮ Error suppression mechanisms for DNA tile self-assembly and their simulation ⋮ Path finding in the tile assembly model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hammersley's interacting particle process and longest increasing subsequences
• The program-size complexity of self-assembled squares (extended abstract)
• Combinatorial optimization problems in self-assembly
• A Stochastic Checkpoint Optimization Problem
• Running time and program size for self-assembled squares
• On Times to Compute Shapes in 2D Tile Self-assembly
• DNA Computing
• DNA Computing
• DNA Computing
• The undecidability of the domino problem
• DNA Computing

This page was built for publication: Self-correcting Self-assembly: Growth Models and the Hammersley Process