Succinct indexes for reporting discriminating and generic words
Document Type
Conference Proceeding
Publication Date
1-1-2014
Abstract
We consider the problem of indexing a collection D of D strings (documents) of total n characters from an alphabet set of size σ, such that whenever a pattern P (of p characters) and an integer τ ∈ [1,D] comes as a query, we can efficiently report all (i) maximal generic words and (ii) minimal discriminating words as defined below:
Publication Source (Journal or Book title)
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
First Page
89
Last Page
100
Recommended Citation
Biswas, S., Patil, M., Shah, R., & Thankachan, S. (2014). Succinct indexes for reporting discriminating and generic words. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8799, 89-100. https://doi.org/10.1007/978-3-319-11918-2
