Sticker systems is a computational model which is an abstraction of th
e way that the Watson-Crick complementarity is used in DNA computing.
We consider such systems of a general form, with blocks of arbitrary s
hapes to be annealed to the currently built sequences. We investigate
the generative power of several variants of sticker systems. Character
izations of regular, linear, and recursively enumerable languages are
obtained in this framework. (C) 1998-Elsevier Science B.V. All rights
reserved.