In Search of Optimal Codes for DNA Computing

DOI10.1007/11925903_11zbMath1132.68392OpenAlexW2134310806MaRDI QIDQ5452568

Sujoy Sinha Roy, Vinhthuy Phan, Andrew J. Neel, Max H. Garzon

Publication date: 4 April 2008

Published in: DNA Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11925903_11

zbMATH Keywords

Gibbs energycomplex DNA self-assemblyencoding data on DNAfault-tolerant DNA computingmaximal code setsshuffle codesWord design

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (4)

Counting (Watson-Crick) palindromes in Watson-Crick conjugates ⋮ Watson-Crick palindromes in DNA computing ⋮ Watson-Crick Conjugate and Commutative Words ⋮ On codeword design in metric DNA spaces

This page was built for publication: In Search of Optimal Codes for DNA Computing