zbMATH — the first resource for mathematics

PUNCH: An evolutionary algorithm for optimizing bit set selection. (English) Zbl 1065.68559
Jonoska, Nataša (ed.) et al., DNA computing. 7th international workshop on DNA-based computers, DNA7, Tampa, FL, USA, June 10–13, 2001. Revised papers. Berlin: Springer (ISBN 3-540-43775-4). Lect. Notes Comput. Sci. 2340, 150-160 (2002).
Summary: Nearly every nucleotide-based computing problem attempted thus far has involved the prearranged assignment of nucleotide sequences to represent bits. However, no general program is yet available to optimize those bit sequences. Careful selection of bit sequences can promote strong annealing between a bit and its intended complement while at the same time minimizing unintended interactions with other bits. In this paper, we present a program that uses an evolutionary algorithm to generate optimum bit sets using given (changeable) criteria. We also test some properties of the program and discuss future applications.
For the entire collection see [Zbl 0992.00041].

68Q10 Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
92D20 Protein sequences, DNA sequences
Full Text: Link