Rule set design problems for oritatami systems
DOI10.1016/J.TCS.2016.09.010zbMATH Open1370.68096OpenAlexW2523042949MaRDI QIDQ529023FDOQ529023
Authors: Makoto Ota, Shinnosuke Seki 
Publication date: 18 May 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.09.010
Recommendations
algorithmic self-assemblytime complexityco-transcriptional foldinglinear-time 2SAT solveroritatami system
Protein sequences, DNA sequences (92D20) Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Graph theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- The complexity of satisfiability problems
- Control of Boolean networks: hardness results and algorithms for tree structured networks
- P-completeness of Cellular Automaton Rule 110
- Nondeterministic seedless oritatami systems and hardness of testing their equivalence
- Programming biomolecules that fold greedily during transcription
Cited In (17)
- Nondeterministic seedless oritatami systems and hardness of testing their equivalence
- Design principles for single-stranded RNA origami structures
- Ruleset optimization on isomorphic oritatami systems
- Know when to fold 'em: self-assembly of shapes by folding in oritatami
- Transcript design problem of oritatami systems
- Programming biomolecules that fold greedily during transcription
- Self-attraction removal from oritatami systems
- Algorithmic design of cotranscriptionally folding 2D RNA origami structures
- Ruleset optimization on isomorphic oritatami systems
- Impossibility of strict assembly of infinite fractals by oritatami
- Self-attraction removal from oritatami systems
- Counting infinitely by oritatami co-transcriptional folding
- Counting infinitely by oritatami co-transcriptional folding
- Towards composable computations by RNA co-transcriptional folding: a proof-of-concept demonstration of nested loops in oritatami
- Transcript design problem of oritatami systems
- Programmable single-stranded architectures for computing
- Proving the Turing universality of oritatami co-transcriptional folding
Uses Software
This page was built for publication: Rule set design problems for oritatami systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q529023)
