Synthesizing Small and Reliable Tile Sets for Patterned DNA Self-assembly (Q3092339): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Algorithm portfolios / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Synthesizing Minimal Tile Sets for Patterned DNA Self-assembly / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal speedup of Las Vegas algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The program-size complexity of self-assembled squares (extended abstract) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4800171 / rank | |||
Normal rank |
Latest revision as of 11:33, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Synthesizing Small and Reliable Tile Sets for Patterned DNA Self-assembly |
scientific article |
Statements
Synthesizing Small and Reliable Tile Sets for Patterned DNA Self-assembly (English)
0 references
16 September 2011
0 references