<s>
GSP	B-Algorithm
algorithm	I-Algorithm
(	O
Generalized	O
Sequential	O
Pattern	O
algorithm	O
)	O
is	O
an	O
algorithm	O
used	O
for	O
sequence	B-Algorithm
mining	I-Algorithm
.	O
</s>
<s>
The	O
algorithms	O
for	O
solving	O
sequence	B-Algorithm
mining	I-Algorithm
problems	O
are	O
mostly	O
based	O
on	O
the	O
apriori	B-Algorithm
(	O
level-wise	O
)	O
algorithm	O
.	O
</s>
<s>
Then	O
,	O
the	O
transactions	B-General_Concept
are	O
filtered	O
by	O
removing	O
the	O
non-frequent	O
items	O
.	O
</s>
<s>
This	O
modified	O
database	O
becomes	O
an	O
input	O
to	O
the	O
GSP	B-Algorithm
algorithm	I-Algorithm
.	O
</s>
<s>
GSP	B-Algorithm
algorithm	I-Algorithm
makes	O
multiple	O
database	O
passes	O
.	O
</s>
<s>
The	O
above	O
algorithm	O
looks	O
like	O
the	O
Apriori	B-Algorithm
algorithm	I-Algorithm
.	O
</s>
<s>
The	O
GSP	B-Algorithm
algorithm	I-Algorithm
discovers	O
frequent	O
sequences	O
,	O
allowing	O
for	O
time	O
constraints	O
such	O
as	O
maximum	O
gap	O
and	O
minimum	O
gap	O
among	O
the	O
sequence	O
elements	O
.	O
</s>
