Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1342094 (Why is no real title available?)
- scientific article; zbMATH DE number 1953223 (Why is no real title available?)
- scientific article; zbMATH DE number 2087012 (Why is no real title available?)
- scientific article; zbMATH DE number 1568800 (Why is no real title available?)
- Aspects of Molecular Computing
- Bounds for DNA codes with constant GC-content
- Characterization of non-crosshybridizing DNA oligonucleotides manufactured in vitro
- Codeword design and information encoding in DNA ensembles
- DNA Computing
- DNA Computing
- DNA Computing
- DNA sequence design using templates
- In Search of Optimal Codes for DNA Computing
- Introduction to algorithms
- Strand design for biomolecular computation.
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
Cited in
(12)- Deterministic polynomial-time algorithms for designing short DNA words
- Deterministic polynomial-time algorithms for designing short DNA words
- DNA Computing
- DNA codeword design: theory and applications
- A content-addressable DNA database with learned sequence encodings
- In Search of Optimal Codes for DNA Computing
- Theory and applications of DNA codeword design
- Linear and nonlinear constructions of DNA codes with Hamming distance \(d\) and constant \(GC\)-content
- A Geometric Approach to Gibbs Energy Landscapes and Optimal DNA Codeword Design
- Coding and Cryptography
- Strand design for biomolecular computation.
- DNA Sticky End Design and Assignment for Robust Algorithmic Self-assembly
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)