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