{'fraction_non_alphanumeric': 0.0327313769751693, 'fraction_numerical': 0.0, 'mean_word_length': 5.335714285714285, '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}}
K-Means Multi-Verse Optimizer (KMVO) Algorithm to Construct DNA Storage Codes

In an era of information explosion, dealing with massive data has become a problem. Since DeoxyriboNucleic Acid (DNA) is a high-density storage medium with long storage endurance, a DNA based storage system is a viable solution. The first consideration of a DNA storage system is the DNA codes, which can avoid non-specific hybridization of DNA strands in the hybridization reaction process by using related constraints, such as Hamming distance constraints, GC-content constraints, and no-runlength constraints. A K-means Multi-Verse Optimizer (KMVO) algorithm is proposed to construct a better code boundary than the previous Multi-Verse Optimizer (MVO) algorithm that satisfies the above constraints. Our results can store information more efficiently over a given length, increasing storage utilization.