Solving unconstraint assignment problem by a molecular-based computing algorithm

Molecular or deoxyribonucleic acid (DNA) computing is a new research of interest whereby the computation can be done by the use of DNA molecules to encode the computational problem. During the computation, the standard molecular biology operations are employed and the output that is encoded also by DNA molecules can be printed by electrophoretical fluorescent method. In this paper, a DNA-based computing algorithm for solving unconstraint assignment problem is presented. It is shown that the proposed algorithm uses almost the same laboratory operations as for an instance of Hamiltonian path problem (HPP) of a graph. Since the laboratory experiment for HPP was very promising, the authors believed that ii is possible to verify the proposed DNA-based computing algorithm for unconstraint assignment problem by laboratory experiment.