Solving NP Hard Problems in the Framework of Gene Assembly in Ciliates

Abstract

Molecular computing [1] is a field with a great potential and fastest growing area of Computer Science. Although some approaches to solve NP hard problems were successfully accomplished on DNA strand, only few results of practical use so far. A direction of molecular computing namely Gene assembly in ciliates has been studied actively [3] for a decade. In the present paper, we use a variant of gene assembly computing model of Guided recombination system with only two operations of insertion and deletion [7] as a decision problem solver. We present our results of parallel algorithms which solve computational hard problems HPP and CSP, in an efficient time.