Pages that link to "Item:Q3070966"
From MaRDI portal
The following pages link to Efficient Turing-Universal Computation with DNA Polymers (Q3070966):
Displaying 4 items.
- Reachability bounds for chemical reaction networks and strand displacement systems (Q268448) (← links)
- Modular verification of chemical reaction network encodings via serializability analysis (Q288812) (← links)
- A strand graph semantics for DNA-based computation (Q288814) (← links)
- DNA walker circuits: computational potential, design, and verification (Q2003463) (← links)
