On applying molecular computation to binary linear codes

  • Authors:

  • K. H. Zimmermann

  • Affiliations:

  • Dept. of Comput. Eng., Technische Univ. Hamburg-Harburg, Hamburg

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2006

Quantified Score

Hi-index 754.84

Visualization

Abstract

Adleman's (1994) successful solution of a seven-vertex instance of the NP-complete Hamiltonian directed path problem by a DNA algorithm initiated the field of biomolecular computing. In this correspondence, we describe DNA algorithms based on the sticker model to perform encoding, minimum-distance computation, and maximum-likelihood (ML) decoding of binary linear codes. We also discuss feasibility and limitations of the sticker algorithms