{'fraction_non_alphanumeric': 0.029940119760479042, 'fraction_numerical': 0.007984031936127744, 'mean_word_length': 5.605263157894737, '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}}
On applying molecular computation to binary linear codes

Adleman's (1994) successful solution of a seven-vertex instance of the NP-complete Hamiltonian directed path problem by a DNA algorithm initiated the field of biomolecular computing. In this correspondence, we describe DNA algorithms based on the sticker model to perform encoding, minimum-distance computation, and maximum-likelihood (ML) decoding of binary linear codes. We also discuss feasibility and limitations of the sticker algorithms.