Improved Lower Bounds for Constant GC-Content DNA Codes

DOI10.1109/TIT.2007.911167MaRDI QIDQ3604560zbMATH OpenFDO

Authors 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

DNA codesexhaustive searchHamming distance modeloligonucleotide librariesstochastic local search

Mathematics Subject Classification ID

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

Abstract: The design of large libraries of oligonucleotides having constant GC-content and satisfying Hamming distance constraints between oligonucleotides and their Watson-Crick complements is important in reducing hybridization errors in DNA computing, DNA microarray technologies, and molecular bar coding. Various techniques have been studied for the construction of such oligonucleotide libraries, ranging from algorithmic constructions via stochastic local search to theoretical constructions via coding theory. We introduce a new stochastic local search method which yields improvements up to more than one third of the benchmark lower bounds of Gaborit and King (2005) for n-mer oligonucleotide libraries when n <= 14. We also found several optimal libraries by computing maximum cliques on certain graphs.

Recommendations

• Bounds for DNA codes with constant GC-content
• Greedy construction of DNA codes and new bounds
• Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm
• Linear and nonlinear constructions of DNA codes with Hamming distance \(d\) and constant \(GC\)-content
• Linear and nonlinear constructions of DNA codes with Hamming distance \(d\), constant GC-content and a reverse-complement constraint
• An improved lower bound for the de Bruijn-Newman constant
• Capacity-Approaching Constrained Codes With Error Correction for DNA-Based Data Storage
• Improved Coding Over Sets for DNA-Based Data Storage
• An improved bound for the de Bruijn-Newman constant
• An improvement of the Gilbert bound for constant weight codes (Corresp.)

Cited in

(14)

• Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm
• Bounds for DNA codes with constant GC-content
• Optimal ternary constant-composition codes with weight four and distance three
• Greedy construction of DNA codes and new bounds
• On conflict free DNA codes
• Designing DNA codes from reversible self-dual codes over \(\mathrm{GF}(4)\)
• 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
• scientific article; zbMATH DE number 1953223 (Why is no real title available?)
• Optimal ternary constant-composition codes with weight four and distance six
• Linear and nonlinear constructions of DNA codes with Hamming distance \(d\) and constant \(GC\)-content
• DNA codes from skew dihedral group ring
• New constructions of reversible DNA codes
• Constructions of quintuple constant-composition codes with weight four and distance three

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

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