Complexity of Compact Proofreading for Self-assembled Patterns

DOI10.1007/11753681_24MaRDI QIDQ3618694zbMATH OpenOpenAlexDBLPWikidataFDO

Authors David Soloveichik, Erik Winfree

Publication date 2 April 2009

Published in DNA Computing (Search for Journal in Brave)

Full work available at URL https://authors.library.caltech.edu/22756/

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05)

Recommendations

• DNA Computing
• Fault-Tolerance in Biochemical Systems
• DNA Computing
• Capabilities and limits of compact error resilience methods for algorithmic self-assembly
• Capabilities and Limits of Compact Error Resilience Methods for Algorithmic Self-assembly in Two and Three Dimensions

Cites work

• Complexities for generalized models of self-assembly
• Complexity of Self‐Assembled Shapes
• DNA Computing
• DNA Computing
• DNA Computing
• DNA Computing
• DNA computing. 10th international workshop on DNA computing, DNA10, Milan, Italy, June 7--10, 2004. Revised selected papers
• scientific article; zbMATH DE number 1241374 (Why is no real title available?)
• scientific article; zbMATH DE number 1342108 (Why is no real title available?)
• scientific article; zbMATH DE number 1568805 (Why is no real title available?)
• Programmable control of nucleation for algorithmic self-assembly
• Running time and program size for self-assembled squares
• The program-size complexity of self-assembled squares (extended abstract)
• The topological entropy of cellular automata is uncomputable

Cited in

(17)

• On the effects of hierarchical self-assembly for reducing program-size complexity
• Activatable tiles for compact robust programmable molecular assembly and other applications
• An introduction to tile-based self-assembly and a survey of recent results
• The program-size complexity of self-assembled squares (extended abstract)
• Complexity of Graph Self-assembly in Accretive Systems and Self-destructible Systems
• A Self-assembly Model of Time-Dependent Glue Strength
• Polyomino-Safe DNA Self-assembly via Block Replacement
• scientific article; zbMATH DE number 4049111 (Why is no real title available?)
• Fault-Tolerance in Biochemical Systems
• Capabilities and Limits of Compact Error Resilience Methods for Algorithmic Self-assembly in Two and Three Dimensions
• Watson-Crick Conjugate and Commutative Words
• Self-assembly of decidable sets
• Watson-Crick palindromes in DNA computing
• Self-assembly of infinite structures: a survey
• Complexity of graph self-assembly in accretive systems and self-destructible systems
• Capabilities and limits of compact error resilience methods for algorithmic self-assembly
• Polyomino-safe DNA self-assembly via block replacement

This page was built for publication: Complexity of Compact Proofreading for Self-assembled Patterns

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