Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Improved Lower Bounds for Constant GC-Content DNA Codes   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.

7
The categories of this paper are: hep-th
23
The categories of this paper are: solv-int
16
The categories of this paper are: stat
31
The categories of this paper are: ao-sci
19
The categories of this paper are: eess
6
The categories of this paper are: astro-ph
13
The categories of this paper are: quant-ph
34
The categories of this paper are: chem-ph
22
The categories of this paper are: chao-dyn
9
The categories of this paper are: nlin
18
The categories of this paper are: econ
25
The categories of this paper are: patt-sol
30
The categories of this paper are: q-alg
29
The categories of this paper are: funct-an
20
The categories of this paper are: acc-phys
33
The categories of this paper are: plasm-ph