Programmable single-stranded architectures for computing
From MaRDI portal
Publication:6535757
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1342097 (Why is no real title available?)
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- An algorithm for straight-line drawing of planar graphs
- Computational Complexity
- Construction of geometric structure by oritatami system
- Counting infinitely by oritatami co-transcriptional folding
- Design principles for single-stranded RNA origami structures
- Displacement Whiplash PCR: Optimized Architecture and Experimental Validation
- Graph theory
- Impossibility of strict assembly of infinite fractals by oritatami
- Isothermal reactivating whiplash PCR for locally programmable molecular computation
- Know when to fold 'em: self-assembly of shapes by folding in oritatami
- Linear Bounds on the Size of Conformations in Greedy Deterministic Oritatami
- Nondeterministic seedless oritatami systems and hardness of testing their equivalence
- On algorithmic self-assembly of squares by co-transcriptional folding
- Oritatami System; a Survey and the Impossibility of Simple Simulation at Small Delays
- Oritatami systems assemble shapes No less complex than tile assembly model (ATAM)
- Programming biomolecules that fold greedily during transcription
- Proving the Turing universality of oritatami co-transcriptional folding
- Rule set design problems for oritatami systems
- Ruleset optimization on isomorphic oritatami systems
- Self-attraction removal from oritatami systems
- Simple intrinsic simulation of cellular automata in oritatami molecular folding model
- Strict self-assembly of discrete Sierpinski triangles
- The Impacts of Dimensionality, Diffusion, and Directedness on Intrinsic Universality in the abstract Tile Assembly Model
- The program-size complexity of self-assembled squares (extended abstract)
- Towards the algorithmic molecular self-assembly of fractals by cotranscriptional folding
- Transcript design problem of oritatami systems
This page was built for publication: Programmable single-stranded architectures for computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535757)
