We consider the problem of indexing a collection D of D strings (documents) of total n characters from an alphabet set of size a, such that whenever a pattern P (of p characters) and an integer tau is an element of [1, D] come as a query, we can efficiently report all (i) maximal generic words and (ii) minimal discriminating words as defined below:
展开▼
