Work

Improved Lower Bounds for Constant GC-Content DNA Codes

Year: 2008
Type: article
Abstract: The design of large libraries of oligonucleotides having constant-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. A new stochastic local search method is introduced, which yields improvements for more than one third of the benchmark lower bounds of Gaborit and King (2005) for n-mer oligonucleotide libraries when n les 14. Several optimal libraries are also found by computing maximum cliques on certain graphs.
Language: English
Open Access status: green
OpenAlex ID: W2047803590
FWCI: 5.597
Cites: 37
Cited by: 58
Related to: 10