The following pages link to (Q4529973):
Displayed 14 items.
- Deterministic polynomial-time algorithms for designing short DNA words (Q391100) (← links)
- The emerging discipline of biomolecular computation in the US (Q698876) (← links)
- Solving the minimum bisection problem using a biologically inspired computational model (Q847667) (← links)
- Arithmetic computation in the tile assembly model: addition and multiplication (Q884443) (← links)
- Nondeterministic polynomial time factoring in the tile assembly model (Q924676) (← links)
- Solving NP-complete problems in the tile assembly model (Q924678) (← links)
- Solving the maximum weighted clique problem based on parallel biological computing model (Q1665198) (← links)
- Strand design for biomolecular computation. (Q1853477) (← links)
- Measurement of the number of molecules of a single mRNA species in a complex mRNA preparation (Q2177155) (← links)
- A DNA-based graph encoding scheme with its applications to graph isomorphism problems (Q2378959) (← links)
- Computing by polymerase chain reaction (Q2476101) (← links)
- A DNA-based solution to the graph isomorphism problem using Adleman-Lipton model with stickers (Q2479238) (← links)
- Solving the maximal matching problem with DNA molecules in Adleman–Lipton model (Q2788698) (← links)
- DNA Recombination by XPCR (Q3618680) (← links)