Linear Bounds on the Size of Conformations in Greedy Deterministic Oritatami

DOI10.1142/s0129054121410082zbMath1517.68120OpenAlexW3160966921MaRDI QIDQ6169891

Unnamed Author, Hwee Kim, Shinnosuke Seki, Reoto Morita, Szilárd Zsolt Fazekas

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

zbMATH Keywords

RNA cotranscriptional foldingoritatamisize of foldable conformationstheory of molecular self-assembly

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Cites Work

• Unnamed Item
• Unnamed Item
• Limitations of self-assembly at temperature 1
• Know when to fold 'em: self-assembly of shapes by folding in oritatami
• Simple intrinsic simulation of cellular automata in oritatami molecular folding model
• Polyominoes with minimum site-perimeter and full set achievement games
• The Complexity of Small Universal Turing Machines: A Survey
• Small Weakly Universal Turing Machines
• The program-size complexity of self-assembled squares (extended abstract)
• The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation
• Running time and program size for self-assembled squares