INCREMENTAL DETERMINATION OF TEIRESIAS PATTERNS

A method for determining Teiresias patterns. Provided as input to the method are: a set S′0 of n sequences denoted as S1, S2, . . . Sn; positive integers L, W, and K; and Teiresias patterns P′0 consisting of all <L, W, K> patterns for the set S′0. Each sequence of the n sequences consists of characters from an alphabet. A sequence index i equals 1. A sequence Sn+1 is supplied to form a set S′i consisting of S′i−1∪Sn+1, where Sn+1 consists of characters from the alphabet. The Teiresias patterns P′i are determined by performing an algorithm that utilizes S′i−1, L, W, K, P′i−1, and Sn+i as input. The Teiresias patterns P′i consist of all <L, W, K> patterns for the set S′i.