Q5091013 (Q5091013): Difference between revisions

@@ Property / cites work @@
+Q5321501
@@ Property / cites work: Q5321501 / rank @@
+Normal rank
@@ Property / cites work @@
+Know when to fold 'em: self-assembly of shapes by folding in oritatami
+Normal rank
@@ Property / cites work @@
+Programming Biomolecules That Fold Greedily During Transcription
+Normal rank
@@ Property / cites work @@
+Ruleset optimization on isomorphic oritatami systems
+Normal rank
@@ Property / cites work @@
+Binary pattern tile set synthesis is NP-hard
@@ Property / cites work: Binary pattern tile set synthesis is NP-hard / rank @@
+Normal rank
@@ Property / cites work @@
+Towards the algorithmic molecular self-assembly of fractals by cotranscriptional folding
+Normal rank
@@ Property / cites work @@
+Q4737167
@@ Property / cites work: Q4737167 / rank @@
+Normal rank
@@ Property / cites work @@
+Rule set design problems for oritatami systems
@@ Property / cites work: Rule set design problems for oritatami systems / rank @@
+Normal rank