Programmable single-stranded architectures for computing
From MaRDI portal
Publication:6535757
DOI10.1007/S11047-023-09963-0zbMATH Open1547.68211MaRDI QIDQ6535757FDOQ6535757
Authors: Yu Kihara, Shinnosuke Seki
Publication date: 9 February 2024
Published in: Natural Computing (Search for Journal in Brave)
Protein sequences, DNA sequences (92D20) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Cites Work
- Graph theory
- Title not available (Why is that?)
- Strict self-assembly of discrete Sierpinski triangles
- The program-size complexity of self-assembled squares (extended abstract)
- Computational Complexity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Displacement Whiplash PCR: Optimized Architecture and Experimental Validation
- Nondeterministic seedless oritatami systems and hardness of testing their equivalence
- Programming biomolecules that fold greedily during transcription
- Rule set design problems for oritatami systems
- An algorithm for straight-line drawing of planar graphs
- Isothermal reactivating whiplash PCR for locally programmable molecular computation
- Design principles for single-stranded RNA origami structures
- Towards the algorithmic molecular self-assembly of fractals by cotranscriptional folding
- Know when to fold 'em: self-assembly of shapes by folding in oritatami
- Transcript design problem of oritatami systems
- Construction of geometric structure by oritatami system
- Simple intrinsic simulation of cellular automata in oritatami molecular folding model
- Counting infinitely by oritatami co-transcriptional folding
- Proving the Turing universality of oritatami co-transcriptional folding
- Oritatami System; a Survey and the Impossibility of Simple Simulation at Small Delays
- The Impacts of Dimensionality, Diffusion, and Directedness on Intrinsic Universality in the abstract Tile Assembly Model
- Self-attraction removal from oritatami systems
- A general architecture of oritatami systems for simulating arbitrary finite automata
- Ruleset optimization on isomorphic oritatami systems
- Impossibility of strict assembly of infinite fractals by oritatami
- Linear Bounds on the Size of Conformations in Greedy Deterministic Oritatami
- Oritatami systems assemble shapes No less complex than tile assembly model (ATAM)
- On algorithmic self-assembly of squares by co-transcriptional folding
This page was built for publication: Programmable single-stranded architectures for computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535757)