{'fraction_non_alphanumeric': 0.018158236057068743, 'fraction_numerical': 0.0, 'mean_word_length': 5.71304347826087, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A MSTP DNA Computing Model Based on Genetic Algorithm and Incompletion-Molecule Commixed Encoding Strategy

Artificial intelligence based on the genetic algorithm and DNA computing based on the biological intelligence is two kinds of important intelligent computing model, Graph theory and combinatorial optimization problem is a hotspot of research on intelligent computing. This paper designs a coding space optimized by using genetic algorithm, and by using DNA computing to solve Minimum Spanning Tree Problem calculation model. Because MSTP (Minimum Spanning Tree Problem) refer to Weight, IMCE (Incompletion-Molecule Commixed Encoding) is used in vertex, edges and weights encoding. The calculation process of the MSTP solution has been detailed described detailed.