{'fraction_non_alphanumeric': 0.01327433628318584, 'fraction_numerical': 0.0, 'mean_word_length': 5.033333333333333, '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}}
ERROR-TOLERANT MINIMUM FINDING WITH DNA COMPUTING

In the past decade, DNA computing has become one of the powerful approaches to solve a class of intractable computational problems such as Hamiltonian path problem and SAT problem. The power of DNA computing comes from the fact that it has great potential of massive data storage and processing computation over data in parallel. In this paper, an algorithm for solving the minimum finding problem is proposed in theory with a randomized scheme – the broadcasting scheme on the broadcast communication model. Our method is a novel strategy for optimization in DNA computing, since it can tolerate some chemistry reaction and experiment errors. The less errors are, the less the number of required iterations is. A series of computer simulations are also performed and analyzed to demonstrate the feasibility of the algorithm and the designed experiment.