Problems of DNA Computing

• Polynomial time but exponential volumes

• A 100 node graph needs 򗧦 molecules.

• Far slower than a PC.

• Experimental errors:

  • mismatch hybridization
  • incomplete cleavage

• Non-reusable.

Previous slide

Next slide

Back to first slide

View graphic version