Improved Lower Bounds for Constant GC-Content DNA Codes

DOI10.1109/TIT.2007.911167zbMath1305.68077arXiv0803.3657MaRDI QIDQ3604560

Yeow Meng Chee, San Ling

Publication date: 24 February 2009

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0803.3657

zbMATH Keywords

stochastic local searchexhaustive searchDNA codesHamming distance modeloligonucleotide libraries

Mathematics Subject Classification ID

Bounds on codes (94B65) Protein sequences, DNA sequences (92D20) Other types of codes (94B60) Information storage and retrieval of data (68P20)

Related Items (8)

A novel approach for constructing reversible codes and applications to DNA codes over the ring \(\mathbb{F}_2 [u /(u^{2 k} - 1)\)] ⋮ Room squares with super-simple property ⋮ Designing DNA codes from reversible self-dual codes over \(\mathrm{GF}(4)\) ⋮ Optimal ternary constant-composition codes with weight four and distance three ⋮ Optimal ternary constant-composition codes with weight four and distance six ⋮ Greedy construction of DNA codes and new bounds ⋮ On conflict free DNA codes ⋮ Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm

This page was built for publication: Improved Lower Bounds for Constant GC-Content DNA Codes