A DNA Computing Model on Triple-Stranded for Minimum Spanning Tree Problem

Single-strand DNA can match with homologous double- stranded into a triple-stranded structure mediated by RecA protein.The paper provides a triple-stranded DNA computing model for minimum spanning tree problem. DNA fragments corresponding to edges are coded by double-stranded DNA, wrong hybridization does not take place and hairpin structure does not form. The single-strand DNA probe is bond with RecA protein, so the rate of wrong solution will reduce. And in this way, encoding complexity and the errors in computation will be decreased.