Pages that link to "Item:Q1277368"
From MaRDI portal
The following pages link to DNA computing based on splicing: The existence of universal computers (Q1277368):
Displaying 25 items.
- Splicing systems with targets are computationally universal (Q671404) (← links)
- Programmed Mutagenesis is universal (Q699813) (← links)
- DNA splicing: Computing by observing (Q835999) (← links)
- Accepting splicing systems (Q974105) (← links)
- DNA computing, sticker systems, and universality (Q1130166) (← links)
- Splicing semigroups of dominoes and DNA (Q1175793) (← links)
- Splicing on tree-like structures (Q1274596) (← links)
- Sticker systems (Q1275468) (← links)
- DNA computing: Arrival of biological mathematics (Q1361168) (← links)
- DNA computing based on splicing: Universality results (Q1575909) (← links)
- On the universality of Post and splicing systems (Q1575914) (← links)
- Using DNA to solve the bounded Post correspondence problem (Q1575917) (← links)
- Aparallel digraphs and splicing machines (Q1660276) (← links)
- Cut, paste and filter. (Q1811127) (← links)
- Derivation languages and descriptional complexity measures of restricted flat splicing systems (Q2306014) (← links)
- Accepting splicing systems with permitting and forbidding words (Q2376984) (← links)
- Graph splicing systems (Q2495908) (← links)
- <font>P</font> SYSTEMS WITH PROTEINS ON MEMBRANES: A SURVEY (Q3076596) (← links)
- Splicing Systems: Accepting Versus Generating (Q3091439) (← links)
- A Brief Tour of Theoretical Tile Self-Assembly (Q3186470) (← links)
- (Q4362740) (← links)
- Insertion-deletion systems with substitutions I (Q5037217) (← links)
- (Q5061519) (← links)
- DNA Computing (Q5494350) (← links)
- Multiple splicing systems and the universal computability (Q5941559) (← links)
