TY  - JOUR
T1  - A Parallel Algorithm for the Degree-Constrained Minimum Spanning Tree  Problem by Using DNA Computing
AU - , Majid Darehmiraki AU - , Hasan Mishmast Nehi 
JO  - Research Journal of Biological Sciences
VL  - 2
IS  - 6
SP  - 658
EP  - 662
PY  - 2007
DA  - 2001/08/19
SN  - 1815-8846
DO  - rjbsci.2007.658.662
UR  - https://makhillpublications.co/view-article.php?doi=rjbsci.2007.658.662
KW  - DNA computing
KW  -NP-complete
KW  -spanning tree
KW  -molecular biology
AB  - DNA computing is new research areas in biology science and information science separately. The essential characteristic of it is the massive parallel of obtaining and managing information. It has been evidenced that DNA computing can solve those problems which are currently intractable on event the fastest electronic computers. The degree-constrained  minimum spanning tree is an important problem in graph theory and it is an NP-complete problem. In this study, we present a algorithm for solving degree-constrained minimum spanning tree problem based on sticker model in DNA computing. The study finds all spanning trees of given graph and minimum spanning tree of given graph.
ER  -