Linear Bounds on the Size of Conformations in Greedy Deterministic Oritatami
DOI10.1142/S0129054121410082zbMATH Open1517.68120OpenAlexW3160966921MaRDI QIDQ6169891FDOQ6169891
Authors: Szilárd Zsolt Fazekas, Hwee Kim, Reoto Morita, Shinnosuke Seki 
Publication date: 15 August 2023
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054121410082
Recommendations
- Ruleset optimization on isomorphic oritatami systems
- Ruleset optimization on isomorphic oritatami systems
- Oritatami System; a Survey and the Impossibility of Simple Simulation at Small Delays
- Transcript design problem of oritatami systems
- Know when to fold 'em: self-assembly of shapes by folding in oritatami
RNA cotranscriptional foldingoritatamisize of foldable conformationstheory of molecular self-assembly
Protein sequences, DNA sequences (92D20) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Cites Work
- Small Weakly Universal Turing Machines
- The program-size complexity of self-assembled squares (extended abstract)
- Running time and program size for self-assembled squares
- Universality in elementary cellular automata
- Limitations of self-assembly at temperature 1
- Polyominoes with minimum site-perimeter and full set achievement games
- The Complexity of Small Universal Turing Machines: A Survey
- Know when to fold 'em: self-assembly of shapes by folding in oritatami
- The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation
- Simple intrinsic simulation of cellular automata in oritatami molecular folding model
- Proving the Turing universality of oritatami co-transcriptional folding
Cited In (1)
This page was built for publication: Linear Bounds on the Size of Conformations in Greedy Deterministic Oritatami
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6169891)
