On applying molecular computation to binary linear codes

IEEE Transactions on Information Theory

Volumn 48, Issue 2, 2002, Pages 505-510

  Zimmermann, Karl Heinz ^a  

^a HAMBURG UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Decoding; Deoxyribonucleic acid (DNA); Encoding; Linear code; Minimum distance; Molecular computation; Sticker model

Indexed keywords

ALGORITHMS; DECODING; DNA; HAMILTONIANS; MAXIMUM LIKELIHOOD ESTIMATION; MOLECULAR BIOLOGY;

MOLECULAR COMPUTATIONS;

BINARY CODES;

EID: 0036477238     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.979325     Document Type: Article

References (19)

1. Molecular computation of solutions to combinatorial problems
2. On applying molecular computation to the Data Encryption Standard
3. Running dynamic programming algorithms on a DNA computer
4. Repeated sequences in DNA
5. Breaking DES using a molecular computer
6. On the weight of computations
7. Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
8. A molecular computation of the road color problem
9. DNA computing: Arrival of biological mathematics
10. DNA computing, sticker systems, and universality
11. DNA solution of hard computational problems
12. A sticker based architecture for DNA computation