Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly (Q391179): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2013.05.009
@@ Property / DOI: 10.1016/j.tcs.2013.05.009 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2013.05.009
+Normal rank
@@ Property / OpenAlex ID @@
+W2019096278
@@ Property / OpenAlex ID: W2019096278 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization problems in self-assembly
+Normal rank
@@ Property / cites work @@
+Running time and program size for self-assembled squares
+Normal rank
@@ Property / cites work @@
+Synthesizing Small and Reliable Tile Sets for Patterned DNA Self-assembly
+Normal rank
@@ Property / cites work @@
+One-Dimensional Staged Self-assembly
@@ Property / cites work: One-Dimensional Staged Self-assembly / rank @@
+Normal rank
@@ Property / cites work @@
+Synthesizing Minimal Tile Sets for Patterned DNA Self-assembly
+Normal rank
@@ Property / cites work @@
+The program-size complexity of self-assembled squares (extended abstract)
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2013.05.009
@@ Property / DOI: 10.1016/J.TCS.2013.05.009 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:391179