… necessary for reducing hybridization errors. With this new algorithm, we were able to
improve on many of the benchmark lower bounds for DNA codes in [10]. The sizes of optimal …

… Our approach starts with a small DNA code and progressively moves it toward a DNA code
… improve on many of the benchmark lower bounds for DNA codes in [10]. The sizes of optimal …

… codes. The existing tag sets contain small tag sequences, so we used a modified genetic
algorithm to improve the lower bound … Thus, we improved the GC content determination method …

… As the actual value of w is unimportant, the aim of the paper is to improve lower bounds
for max w ( A 4 G C ( n , d , w ) ) . The maximum often occurs for w = ⌊ n / 2 ⌋ , but there are …

… find DNA codes with the maximum number of codewords. In this paper the construction of DNA
codes … to match or improve the best known lower bounds in 180 cases, with 52 new bests. …

… Entries in bold are new best lower bounds found by the … constructions of DNA codes with
constant GC-content. Discrete … neighbourhoods improve stochastic local search for DNA code …

… From now on, we will prove that the proposed DNA codes indeed have constant GC-content
and derive the minimum Hamming distance dmin of the DNA codes from Construction 1. …

… GC-content, we’ll prefer to call this number the Fq-weight of the word. As an immediate
consequence a general lower bound … -codes for n = 13 and 29, we obtain the improved bounds …

… , we are construct a new DNA code with constant GC-content from a binary constant weight
… Ling, “Improved lower bounds for constant GCcontent DNA codes,” IEEE Trans. Inf. Theory, …

… and lower bounds on the maximum size of DNA codes of length n with constant GC-content
w … meet or exceed Gilbert-type lower bounds; they often do much better [6]. There are many …