{'fraction_non_alphanumeric': 0.011637572734829594, 'fraction_numerical': 0.0, 'mean_word_length': 4.873170731707317, '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}}
Hybridization and ring optimization for larger sets of embeddable biomarkers

Embeddable biomarkers are short strands of DNA that can be incorporated into genetic constructs to enable later identification. They are drawn from error correcting codes on the DNA alphabet relative to the Levenshtein metric. This study uses three types of evolutionary algorithms to improve the best known size of DNA error correcting codes, improving the bound for nine different code parameters. One of the algorithms is used on only one set of code parameters, correcting an oversight in an earlier study. The other two algorithms are a ring optimizer and a hybridizing evolutionary algorithm that exploits previously known codes. The ring optimizer improves two code size bounds and sets the stage for the hybridizer to improve four more. The hybridizer requires the results of a previous search as a starting point. Starting with known codes from earlier work, it improves a total of six bounds. The best results found by this algorithm used the results of the ring optimizer as a starting point. The paper discusses the issue of building a suite of cooperative code-search algorithms as a good target for future work.