Identifying patterns of symbols in sequences of symbols using a binary array representation of the sequence

摘要

The present invention relates to computer-implemented methods for finding patterns in patterns in a set of k-sequences of symbols (where k≧2) and to a computer readable medium having instructions for controlling a computer system to perform the methods. Patterns of symbols common to each 2-tuple of sequences are identified. Each identified pattern of symbols is represented by a position index binary array (PIBA) which is a set of binary digits. The binary digit in each place in the array that corresponds to a location in a selected reference sequence of a symbol in the identified pattern has a first predetermined binary value. All of the other binary digits in the array have a second predetermined binary value. The position index binary array (PIBA) representations of patterns of each tuple at any order “n” may be combined with the PIBA pattern representations of all other tuples at that same order “n” or with the pattern representations in any selected m-tuple, where m may have any integer value from 2 to (n−1). The patterns of the resulting tuple are identified from the position index binary arrays (PIBAs) produced by the intersection of the set of binary digits in each position index binary array (PIBA) in the n-tuple with the set of binary digits in each position index binary array (PIBA) in the other tuple. The intersections are accomplished logically, as by performing a logical AND operation in a bit-by-bit manner on the binary arrays. Using the places in the position index binary array (PIBA) produced by the intersections having the first predetermined binary value as a guide, the symbols in corresponding locations in the reference sequence are identified. These symbols comprise the symbols in the identified pattern in the resulting tuple.