{'fraction_non_alphanumeric': 0.0159798149705635, 'fraction_numerical': 0.009251471825063078, 'mean_word_length': 4.9798994974874375, '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}}
[Plan for finding homologies in nucleotide sequence databases using preliminarily calculated sequence samples].

A scheme of fast similarity search of nucleotide sequences is suggested based on sequence imaging, which results in chunks of information much less than original sequence but more specialized for comparison. Three methods were developed using three different imaging functions. The first is based on identity of local sites of up to twelve nucleotides, the second is based on statistical homology of local 42 nucleotide fragments, and the third is based on the homology of 100-150 nucleotide fragments and models the comparison of restriction maps. Each of them requires the library of sequence images. The total size of such a library is less than the size of sequences stored in compressed form. The sequences are aligned allowing local homology searches. The method reduces total time for a similarity search about 100-fold. The programs can be easily included in any software, which allows user to define his own set of sequences. One of the programs is implemented within DNA-SUN software and is used in Institute of Molecular Genetics and Institute of Molecular Biology.