Pages that link to "Item:Q3618694"
From MaRDI portal
The following pages link to Complexity of Compact Proofreading for Self-assembled Patterns (Q3618694):
Displaying 17 items.
- An introduction to tile-based self-assembly and a survey of recent results (Q256961) (← links)
- Self-assembly of decidable sets (Q553922) (← links)
- Self-assembly of infinite structures: a survey (Q616502) (← links)
- Complexity of graph self-assembly in accretive systems and self-destructible systems (Q633697) (← links)
- Capabilities and limits of compact error resilience methods for algorithmic self-assembly (Q848844) (← links)
- Polyomino-safe DNA self-assembly via block replacement (Q968384) (← links)
- Optimal self-assembly of finite shapes at temperature 1 in 3D (Q1635717) (← links)
- Staged self-assembly and polyomino context-free grammars (Q2003475) (← links)
- On the effects of hierarchical self-assembly for reducing program-size complexity (Q2243581) (← links)
- Activatable tiles for compact robust programmable molecular assembly and other applications (Q2311273) (← links)
- The program-size complexity of self-assembled squares (extended abstract) (Q3192015) (← links)
- Complexity of Graph Self-assembly in Accretive Systems and Self-destructible Systems (Q3618692) (← links)
- A Self-assembly Model of Time-Dependent Glue Strength (Q3618693) (← links)
- Polyomino-Safe DNA Self-assembly via Block Replacement (Q3643097) (← links)
- (Q3786000) (← links)
- Watson-Crick Conjugate and Commutative Words (Q5452701) (← links)
- Watson-Crick palindromes in DNA computing (Q5962061) (← links)