On applying molecular computation to binary linear

被引：5
作者：
Zimmermann, KH [1 ]
机构：
[1] Tech Univ Hamburg, Dept Comp Engn, D-21071 Hamburg, Germany
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 2002年 / 48卷 / 02期
关键词：
decoding; deoxyribonucleic acid (DNA); encoding; linear code; minimum distance; molecular computation; sticker model;
D O I：
10.1109/18.979325
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Adleman's 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.
引用
收藏
页码：505 / 510
页数：6
相关论文
共 19 条
12