In Search of Optimal Codes for DNA Computing

DOI10.1007/11925903_11MaRDI QIDQ5452568zbMATH OpenOpenAlexFDO

Authors Vinhthuy Phan, Sujoy Sinha Roy, 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

complex DNA self-assemblyencoding data on DNAfault-tolerant DNA computingGibbs energymaximal code setsshuffle codesWord design

Mathematics Subject Classification ID

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

Recommendations

• DNA Computing
• On codeword design in metric DNA spaces
• Aspects of Molecular Computing
• Codeword design and information encoding in DNA ensembles
• Theory and applications of DNA codeword design

Cited in

(11)

• Counting (Watson-Crick) palindromes in Watson-Crick conjugates
• PROCEDURES FOR COMPUTING THE MAXIMUM WITH DNA
• scientific article; zbMATH DE number 1738647 (Why is no real title available?)
• Theory and applications of DNA codeword design
• scientific article; zbMATH DE number 2087015 (Why is no real title available?)
• scientific article; zbMATH DE number 821893 (Why is no real title available?)
• A Geometric Approach to Gibbs Energy Landscapes and Optimal DNA Codeword Design
• Watson-Crick Conjugate and Commutative Words
• Watson-Crick palindromes in DNA computing
• Codeword design and information encoding in DNA ensembles
• On codeword design in metric DNA spaces

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452568)