<s>
The	O
Teiresias	B-Algorithm
algorithm	I-Algorithm
is	O
a	O
combinatorial	O
algorithm	O
for	O
the	O
discovery	O
of	O
rigid	O
patterns	O
(	O
motifs	O
)	O
in	O
biological	O
sequences	O
.	O
</s>
<s>
The	O
Teiresias	B-Algorithm
algorithm	I-Algorithm
is	O
based	O
on	O
the	O
observation	O
that	O
if	O
a	O
pattern	O
spans	O
many	O
positions	O
and	O
appears	O
exactly	O
k	O
times	O
in	O
the	O
input	O
then	O
all	O
fragments	O
(	O
sub	O
patterns	O
)	O
of	O
the	O
pattern	O
have	O
to	O
appear	O
at	O
least	O
k	O
times	O
in	O
the	O
input	O
.	O
</s>
<s>
A	O
new	O
implementation	O
of	O
the	O
Teiresias	B-Algorithm
algorithm	I-Algorithm
was	O
recently	O
made	O
available	O
by	O
the	O
.	O
</s>
<s>
The	O
Teiresias	B-Algorithm
algorithm	I-Algorithm
uses	O
regular	B-Language
expressions	I-Language
to	O
define	O
the	O
patterns	O
.	O
</s>
