A compact introduction to molecular computation

The paper surveys DNA computing as a model in which biochemical operations encode and evaluate computational possibilities. It introduces the field through landmark combinatorial-problem work and contrasts molecular parallelism with the sequential character of conventional processors.

The review also examines DNA as a high-density information medium, the experimental workflow required to manipulate molecular states, and the gap between theoretical scale and practical laboratory reliability.

Why DNA was interesting as a computing substrate

  • Large populations of DNA strands can represent many candidate solutions at the same time.
  • Nucleotide sequences provide an extremely compact way to encode information.
  • Laboratory operations replace familiar electronic instructions, introducing latency, error, and observability challenges.
  • The field is most compelling where massive combinatorial search outweighs biochemical setup and readout costs.

A survey of a specialized computing model

The paper should be read as an accessible map of a research area rather than as a claim that DNA computers were ready to replace general-purpose machines. It records how biological media challenged assumptions about representation, execution, and scale.

Claim boundary

The publication is a survey. Performance and feasibility claims depend on the cited experiments and the state of molecular-computing research in 2016; they are not results from a new hardware implementation in this paper.

Original publication record

Published in the International Journal on Recent and Innovation Trends in Computing and Communication, Volume 4, Issue 4, pages 22–26.

Tiwari, V. P., Tiwari, V., & Patkar, U. C. (2016). DNA Computing and Implementations. IJRITCC, 4(4), 22–26. https://doi.org/10.17762/ijritcc.v4i4.1947

Continue through the archive