Counting infinitely by oritatami co-transcriptional folding
From MaRDI portal
Publication:6095499
DOI10.1007/s11047-021-09842-6zbMath1530.68101OpenAlexW4246657248MaRDI QIDQ6095499
Kohei Maruyama, Shinnosuke Seki
Publication date: 8 September 2023
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-021-09842-6
Protein sequences, DNA sequences (92D20) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rule set design problems for oritatami systems
- Computability and complexity in self-assembly
- Towards the algorithmic molecular self-assembly of fractals by cotranscriptional folding
- Know when to fold 'em: self-assembly of shapes by folding in oritatami
- Construction of geometric structure by oritatami system
- Simple intrinsic simulation of cellular automata in oritatami molecular folding model
- The program-size complexity of self-assembled squares (extended abstract)
- Running time and program size for self-assembled squares
- Ruleset optimization on isomorphic oritatami systems
This page was built for publication: Counting infinitely by oritatami co-transcriptional folding