1. A method for determining Teiresias patterns, said method comprising the steps of: providing a set S′ 0 of n sequences denoted as S 1 , S 2 ,. .. S n , 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 consisting of characters from an alphabet, wherein a sequence index i equals 1; supplying a sequence S n+1 to form a set S′ i consisting of S′ i-1 ∪S n+1 , wherein S n+1 consists of characters from the alphabet; and determining Teiresias patterns P′ i consisting of all <L, W, K> patterns for the set S′ i by performing an algorithm that utilizes S′ i-1 , L, W, K, P′ i-1 , and S n+i as input.