Search for Substrings in Associative Decision Fields

The article was devoted to the prerequisites of the use of computational SIMD structures of the associative memory type for organizing work with data string, in particular for finding occurrences of the search substring in a long string such as a string of the genetic code. The input structures of the line and orthogonal data input are proposed. The procedures for finding the entries for different ratios of the lengths of the genetic string, the occurrence substring, the size of the associative field, and the conditions for data entry are developed.