The following pages link to On the computational power of DNA (Q5961619):
Displayed 19 items.
- Graph-theoretic formalization of hybridization in DNA sticker complexes (Q256713) (← links)
- The emerging discipline of biomolecular computation in the US (Q698876) (← links)
- Experimental efficiency of programmed mutagenesis (Q698889) (← links)
- DNA computing: Arrival of biological mathematics (Q1361168) (← links)
- Using DNA to solve the bounded Post correspondence problem (Q1575917) (← links)
- Cyclic DNA codes over the ring \(\mathbb {F}_2+u\mathbb {F}_2+v\mathbb {F}_2+uv\mathbb {F}_2+v^2\mathbb {F}_2+uv^2\mathbb {F}_2\) (Q1647559) (← links)
- Designing DNA codes from reversible self-dual codes over \(\mathrm{GF}(4)\) (Q2219951) (← links)
- Secure hash algorithm-2 formed on DNA (Q2338177) (← links)
- Graph splicing systems (Q2495908) (← links)
- Leader Election and Shape Formation with Self-organizing Programmable Matter (Q2948412) (← links)
- Graph-Theoretic Formalization of Hybridization in DNA Sticker Complexes (Q3092332) (← links)
- A CONSTANT TIME ALGORITHM FOR DNA ADD (Q3636161) (← links)
- DNA2DNA computations: A potential “killer app”? (Q4571939) (← links)
- Molecular computing, bounded nondeterminism, and efficient recursion (Q4572009) (← links)
- (Q4704801) (← links)
- Improved Leader Election for Self-organizing Programmable Matter (Q5056058) (← links)
- Distributed transformations of Hamiltonian shapes based on line moves (Q5918588) (← links)
- Distributed transformations of Hamiltonian shapes based on line moves (Q5918708) (← links)
- On the computational power of DNA (Q5961619) (← links)