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

DOI10.1016/J.TCS.2024.114550MaRDI QIDQ6496883zbMATH OpenFDO

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

Publication date 6 May 2024

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

Full work available at URL https://doi.org/10.1016/J.TCS.2024.114550

zbMATH Keywords

composition of computationscountingnested for-loopsoritatami modelRNA co-transcriptional foldingshift-driven co-transcriptional computing

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Single-stranded architectures for computing
• Proving the Turing universality of oritatami co-transcriptional folding
• Transcript design problem of oritatami systems
• Transcript design problem of oritatami systems
• Oritatami System; a Survey and the Impossibility of Simple Simulation at Small Delays

Cites work

• Design principles for single-stranded RNA origami structures
• Programming biomolecules that fold greedily during transcription
• Proving the Turing universality of oritatami co-transcriptional folding
• 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)

Cited in

(2)

• Single-stranded architectures for computing
• Delay-tolerant oritatami binary counter

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496883)