On codeword design in metric DNA spaces
From MaRDI portal
Publication:734201
DOI10.1007/S11047-008-9088-6zbMATH Open1192.68279OpenAlexW2078129336MaRDI QIDQ734201FDOQ734201
Publication date: 19 October 2009
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-008-9088-6
Recommendations
DNA hybridizationGibbs energyCodeword design\(h\)-DistanceData coding in DNAMaximal codesMetric DNA space
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Theory of data (68P99)
Cites Work
- Introduction to algorithms
- Title not available (Why is that?)
- DNA sequence design using templates
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Bounds for DNA codes with constant GC-content
- Title not available (Why is that?)
- Strand design for biomolecular computation.
- Title not available (Why is that?)
- Codeword design and information encoding in DNA ensembles
- Title not available (Why is that?)
- Title not available (Why is that?)
- In Search of Optimal Codes for DNA Computing
- DNA Computing
- DNA Computing
- DNA Computing
- Aspects of Molecular Computing
- Characterization of non-crosshybridizing DNA oligonucleotides manufactured in vitro
Cited In (7)
- Deterministic polynomial-time algorithms for designing short DNA words
- DNA Computing
- Linear and nonlinear constructions of DNA codes with Hamming distance \(d\) and constant \(GC\)-content
- Strand design for biomolecular computation.
- DNA Sticky End Design and Assignment for Robust Algorithmic Self-assembly
- DNA Codeword Design: Theory and Applications
- A Geometric Approach to Gibbs Energy Landscapes and Optimal DNA Codeword Design
This page was built for publication: On codeword design in metric DNA spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q734201)
