2008/01/01 by Yeow Meng Chee, San Ling
Biochemistry, Genetics and Molecular Biology · Computer Science · Mathematics · #Advanced biosensing and bioanalysis techniques #DNA and Biological Computing #DNA and Nucleic Acid Chemistry #cs.DS #cs.IT #math.CO #math.IT #q-bio.GN #q-bio.QM
paper · pdf · doi:10.1109/tit.2007.911167
published as IEEE Transactions on Information Theory, vol. 54, no. 1, pp. 391-394, 2008 · 4 pages
openalex publication_date 2008/01/01 · arxiv created 2008/03/26 · arxiv updated 2009/12/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
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.