Abstract Although much work has been done on constructing minimal spanning trees, no studies have attempted to solve this problem using DNA computation. This paper describes the first DNA algorithm for constructing minimal spanning trees. In 1994, Leonard M. Adleamn used biological experiments with DNA strands to solve computation problems. The potential benefits of using this particular molecule are enormous due to the massive inherent parallelism of performing concurrent operations on trillions of strands. The proposed algorithm will randomly generate all possible solutions to the problem at hand and isolate the correct solution through repeated separations of the DNA into incorrect solutions and potentially good solutions. This algorithm is simpler than convention algorithms in many aspects such as no requirement for checking the processing elements concurrently, asynchronously, infinite loop, deadlock etc.