The following pages link to (Q4224901):
Displaying 10 items.
- On the scalability of biocomputing algorithms: the case of the maximum clique problem (Q433111) (← 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)
- Biological computation of the solution to the quadratic assignment problem (Q929455) (← links)
- An error-correcting code framework for genetic sequence analysis (Q2492546) (← links)
- Terminal pair maximal flow finding using DNA computation (Q2780801) (← links)
- Approximate reasoning on a DNA‐chip (Q3059787) (← links)
- DNA2DNA computations: A potential “killer app”? (Q4571939) (← links)
- A ROBUST DNA COMPUTATION MODEL THAT CAPTURES PSPACE (Q5696946) (← links)
- On the computational power of DNA (Q5961619) (← links)