Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly
From MaRDI portal
Publication:391179
DOI10.1016/j.tcs.2013.05.009zbMath1296.68065MaRDI QIDQ391179
Eugen Czeizler, Alexandru Popa
Publication date: 10 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.05.009
92D20: Protein sequences, DNA sequences
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05B45: Combinatorial aspects of tessellation and tiling problems
Related Items
A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis, Binary pattern tile set synthesis is NP-hard, Computational modelling of the kinetic tile assembly model using a rule-based approach, The Complexity of Fixed-Height Patterned Tile Self-assembly
Cites Work
- Synthesizing Minimal Tile Sets for Patterned DNA Self-assembly
- One-Dimensional Staged Self-assembly
- Synthesizing Small and Reliable Tile Sets for Patterned DNA Self-assembly
- The program-size complexity of self-assembled squares (extended abstract)
- Combinatorial optimization problems in self-assembly
- Running time and program size for self-assembled squares