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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q42 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q45 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6691864 / rank
 
Normal rank
Property / zbMATH Keywords
 
DNA computing
Property / zbMATH Keywords: DNA computing / rank
 
Normal rank
Property / zbMATH Keywords
 
biocomputing
Property / zbMATH Keywords: biocomputing / rank
 
Normal rank
Property / zbMATH Keywords
 
formal languages
Property / zbMATH Keywords: formal languages / rank
 
Normal rank
Property / zbMATH Keywords
 
polymers
Property / zbMATH Keywords: polymers / rank
 
Normal rank
Property / zbMATH Keywords
 
context-free grammars
Property / zbMATH Keywords: context-free grammars / rank
 
Normal rank

Revision as of 03:27, 1 July 2023

scientific article
Language Label Description Also known as
English
Tight bounds for active self-assembly using an insertion primitive
scientific article

    Statements

    Tight bounds for active self-assembly using an insertion primitive (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 March 2017
    0 references
    DNA computing
    0 references
    biocomputing
    0 references
    formal languages
    0 references
    polymers
    0 references
    context-free grammars
    0 references

    Identifiers