Abstract

The paper discusses the fundamental role of the Watson-Crick complementarity in DNA computing. The close relation of the complementarity to the twin-shuffle language guarantees the universal computing power for any model of DNA computing possessing sufficient input and output facilities. Some such models are also briefly discussed.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call