On codeword design in metric DNA spaces
From MaRDI portal
Publication:734201
DOI10.1007/s11047-008-9088-6zbMath1192.68279OpenAlexW2078129336MaRDI QIDQ734201
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
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)
Related Items
DNA Codeword Design: Theory and Applications ⋮ Deterministic polynomial-time algorithms for designing short DNA words ⋮ DNA Sticky End Design and Assignment for Robust Algorithmic Self-assembly
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- DNA sequence design using templates
- Codeword design and information encoding in DNA ensembles
- Characterization of non-crosshybridizing DNA oligonucleotides manufactured in vitro
- Bounds for DNA codes with constant GC-content
- Strand design for biomolecular computation.
- In Search of Optimal Codes for DNA Computing
- DNA Computing
- DNA Computing
- DNA Computing
- Aspects of Molecular Computing