Towards composable computations by RNA co-transcriptional folding: a proof-of-concept demonstration of nested loops in oritatami

DOI10.1016/J.TCS.2024.114550MaRDI QIDQ6496883

Hinano Takeuchi, Szilárd Zsolt Fazekas, Yu Kihara, Shinnosuke Seki, Unnamed Author, Naoya Iwano

Publication date: 6 May 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

countingcomposition of computationsnested for-loopsoritatami modelRNA co-transcriptional foldingshift-driven co-transcriptional computing

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Rule set design problems for oritatami systems
• Simple intrinsic simulation of cellular automata in oritatami molecular folding model
• The program-size complexity of self-assembled squares (extended abstract)
• Programming Biomolecules That Fold Greedily During Transcription
• Design Principles for Single-Stranded RNA Origami Structures
• Unnamed Item

This page was built for publication: Towards composable computations by RNA co-transcriptional folding: a proof-of-concept demonstration of nested loops in oritatami