Article citationsMore>>

Perez-Jimenez, M.J. and Sancho-Caparrini, F. (2001) Solving knapsack problems in a sticker based model. Series in Discrete Mathematics and Theoretical Computer Science, Seventh Annual Workshop on DNA Computing, Princeton University, Series in Discrete Mathematics and Theoretical Computer Science, DIMACS, American Mathematical Society.

has been cited by the following article:

• TITLE: Solving the independent set problem by sticker based DNA computers

  AUTHORS: Hassan Taghipour, Ahad Taghipour, Mahdi Rezaei, Heydar Ali Esmaili

  KEYWORDS: Parallel Computing; Sticker Based DNA Computers; Independent Set Problem; NP-Complete Problem

  JOURNAL NAME: American Journal of Molecular Biology, Vol.2 No.2, April 28, 2012

  ABSTRACT: In this paper, the sticker based DNA computing was used for solving the independent set problem. At first, solution space was constructed by using appropriate DNA memory complexes. We defined a new operation called “divide” and applied it in construction of solution space. Then, by application of a sticker based parallel algorithm using biological operations, independent set problem was resolved in polynomial time.