Tight bounds for active self-assembly using an insertion primitive (Q513280): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
Merged Item from Q2921453
aliases / en / 0aliases / en / 0
 
Tight Bounds for Active Self-assembly Using an Insertion Primitive
description / endescription / en
 
scientific article; zbMATH DE number 6352789
Property / title
 
Tight Bounds for Active Self-assembly Using an Insertion Primitive (English)
Property / title: Tight Bounds for Active Self-assembly Using an Insertion Primitive (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1421.68049 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-662-44777-2_56 / rank
 
Normal rank
Property / published in
 
Property / published in: Algorithms - ESA 2014 / rank
 
Normal rank
Property / publication date
 
8 October 2014
Timestamp+2014-10-08T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 8 October 2014 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6352789 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2595558125 / rank
 
Normal rank

Revision as of 13:06, 29 April 2024

scientific article; zbMATH DE number 6352789
  • Tight Bounds for Active Self-assembly Using an Insertion Primitive
Language Label Description Also known as
English
Tight bounds for active self-assembly using an insertion primitive
scientific article; zbMATH DE number 6352789
  • Tight Bounds for Active Self-assembly Using an Insertion Primitive

Statements

Tight bounds for active self-assembly using an insertion primitive (English)
0 references
Tight Bounds for Active Self-assembly Using an Insertion Primitive (English)
0 references
0 references
0 references
0 references
0 references
0 references
3 March 2017
0 references
8 October 2014
0 references
DNA computing
0 references
biocomputing
0 references
formal languages
0 references
polymers
0 references
context-free grammars
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references