Transcript design problem of oritatami systems
From MaRDI portal
(Redirected from Publication:1621140)
Recommendations
Cited in
(18)- Proving the Turing universality of oritatami co-transcriptional folding
- Design principles for single-stranded RNA origami structures
- Know when to fold 'em: self-assembly of shapes by folding in oritatami
- Ruleset optimization on isomorphic oritatami systems
- Dynamic extended folding: modeling the RNA secondary structures during co-transcriptional folding
- Programming biomolecules that fold greedily during transcription
- Self-attraction removal from oritatami systems
- Algorithmic design of cotranscriptionally folding 2D RNA origami structures
- Linear Bounds on the Size of Conformations in Greedy Deterministic Oritatami
- Ruleset optimization on isomorphic oritatami systems
- Impossibility of strict assembly of infinite fractals by oritatami
- Self-attraction removal from oritatami systems
- Counting infinitely by oritatami co-transcriptional folding
- Towards composable computations by RNA co-transcriptional folding: a proof-of-concept demonstration of nested loops in oritatami
- Transcript design problem of oritatami systems
- Simple intrinsic simulation of cellular automata in oritatami molecular folding model
- Programmable single-stranded architectures for computing
- Rule set design problems for oritatami systems
This page was built for publication: Transcript design problem of oritatami systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1621140)
