{'fraction_non_alphanumeric': 0.013574660633484163, 'fraction_numerical': 0.0, 'mean_word_length': 4.579831932773109, '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}}
Methods for discovering novel motifs in nucleic acid sequences

We describe a computer tool to aid the discovery of new motifs in nucleic acid sequences. A typical use would be to analyse a set of upstream regions from a family of related genes in order to find possible control sequences. The heart of the method is the creation of dictionaries of related subsequences. These dictionaries can then be analysed to look for the commonest or best-defined subsequences, those that occur in the highest number of different sequences, or for those in equivalent positions within the family. We show the application of the method to a set of E. coli promoter sequences.