Pages that link to "Item:Q391179"
From MaRDI portal
The following pages link to Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly (Q391179):
Displaying 10 items.
- Search methods for tile sets in patterned DNA self-assembly (Q395021) (← links)
- A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis (Q511695) (← links)
- Binary pattern tile set synthesis is NP-hard (Q527409) (← links)
- Computational modelling of the kinetic tile assembly model using a rule-based approach (Q1682869) (← links)
- 3-color bounded patterned self-assembly (Q2003474) (← links)
- The Complexity of Fixed-Height Patterned Tile Self-assembly (Q2830225) (← links)
- Synthesizing Minimal Tile Sets for Patterned DNA Self-assembly (Q3070963) (← links)
- Synthesizing Small and Reliable Tile Sets for Patterned DNA Self-assembly (Q3092339) (← links)
- Tile-Based DNA Nanostructures (Q4627736) (← links)
- Tile-based modeling of DNA self-assembly for two graph families with appended paths (Q6102107) (← links)
