An Efficient DNA Computing Model for Harmonious Colouring Problem

Abstract

DNA computation is an exceptional technique for parallel computation. It is a system suggested for finding solution to intractable computational hard problems. The complexity of NP-Complete problem upturns exponentially with the input size of the graph. This work develops a novel DNA exploring model to find the solution to the Harmonious Colouring Problem (HCP).  This DNA processing model solves the HCP in polynomial time calculation.