Dan C. Tulpan; Holger H. Hoos; Anne E. Condon
DNA Computing., 2002, 229-241
https://doi.org/10.1007/3-540-36440-4_20

Abstract

We present results on the performance of a stochastic local search algorithm for the design of DNA codes, namely sets of equallength words over the nucleotides alphabet A,C,G, T that satisfy certain combinatorial constraints. Using empirical analysis of the algorithm, we gain insight on goodd esign principles. We report several cases in which our algorithm finds word sets that match or exceed the best previously known constructions.