int preSO(char *x, int m, unsigned int S[])
{
	unsigned int j, lim;
	int i;
	for (i = 0; i < ASIZE; ++i)
		S[i] = ~0;
	for (lim = i = 0, j = 1; i < m; ++i, j <<= 1)
	{
		S[x[i]] &= ~j;
		lim |= j;
	}
	lim = ~(lim>>1);
	return(lim);
}

void SO(char *x, int m, char *y, int n)
{
	unsigned int lim, state;
	unsigned int S[ASIZE];
	int j;
	if (m > WORD)
		error("SO: Use pattern size <= word size");

	/* Preprocesamiento */
	lim = preSO(x, m, S);

	/* Búsqueda */
	for (state = ~0, j = 0; j < n; ++j)
	{
		state = (state<<1) | S[y[j]];
		if (state < lim)
			OUTPUT(j - m + 1);
	}
}