| [177021] |
| Title: On applying molecular computation to binary linear codes. |
| Written by: Karl-Heinz Zimmermann |
| in: <em>IEEE Transactions on Information Theory</em>. February (2002). |
| Volume: <strong>48</strong>. Number: (2), |
| on pages: 505-510 |
| Chapter: |
| Editor: |
| Publisher: IEEE: |
| Series: |
| Address: |
| Edition: |
| ISBN: 10.1109/18.979325 |
| how published: 02-95 Zimm02a TIT |
| Organization: |
| School: |
| Institution: |
| Type: |
| DOI: |
| URL: |
| ARXIVID: |
| PMID: |
Note: khzimmermann, AEG
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.