In order to resolve the minimal set covering problem availably,the sticker model of DNA computation based on sticking operations is introduced.With the aid of sticker model,the minimal set covering problem can be solved by transforming the subset to memory complex and utilizing the mas- sive parallelism of sticking operations.An example is given to explain the algorithm in detail.