Improved Lower Bounds for Constant GC-Content DNA Codes

Simple item page
dc.creatorChee, Yeow Meng
dc.creatorLing, San
dc.date2008-03-26
dc.date.accessioned2026-07-07T09:28:23Z
dc.date.available2026-07-07T09:28:23Z
dc.descriptionThe 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.
dc.description4 pages
dc.identifierhttps://arxiv.org/abs/0803.3657
dc.identifierhttp://arxiv.org/abs/0803.3657
dc.identifierIEEE Transactions on Information Theory, vol. 54, no. 1, pp. 391-394, 2008
dc.identifierdoi:10.1109/TIT.2007.911167
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/157436
dc.subjectInformation Theory
dc.subjectData Structures and Algorithms
dc.subjectCombinatorics
dc.subjectGenomics
dc.subjectQuantitative Methods
dc.titleImproved Lower Bounds for Constant GC-Content DNA Codes
dc.typetext

Files

Collections

arXiv