Succinct data structures for flexible text retrieval systems

S. Muthukrishnan, Efficient algorithms for document retrieval problems, in: Proc. ACM-SIAM SODA, 2002, pp. 657–666 Blumer, 1987, Complete inverted files for efficient text retrieval and analysis, Journal of the ACM, 34, 578, 10.1145/28869.28873 Grossi, 2005, Compressed suffix arrays and suffix trees with applications to text indexing and string matching, SIAM Journal on Computing, 35, 378, 10.1137/S0097539702402354 R. Grossi, A. Gupta, J.S. Vitter, Higher order entropy analysis of compressed suffix arrays, in: DIMACS Workshop on Data Compression in Networks and Applications, 2003, pp. 841–850 K. Sadakane, Succinct representations of lcp information and improvements in the compressed suffix arrays, in: Proc. ACM-SIAM SODA, 2002, pp. 225–232 Sadakane, 2003, New text indexing functionalities of the compressed suffix arrays, Journal of Algorithms, 48, 294, 10.1016/S0196-6774(03)00087-7 Ferragina, 2005, Indexing compressed texts, Journal of the ACM, 52, 552, 10.1145/1082036.1082039 Salton, 1975, A vector space model for automatic indexing, Communications of the ACM, 18, 613, 10.1145/361219.361220 Manber, 1993, Suffix arrays: a new method for on-line string searches, SIAM Journal on Computing, 22, 935, 10.1137/0222058 P. Weiner, Linear pattern matching algorithms, in: Proceedings of the 14th IEEE Symposium on Switching and Automata Theory, 1973, pp. 1–11 M. Farach, Optimal suffix tree construction with large alphabets, in: 38th IEEE Symp. on Foundations of Computer Science, 1997, pp. 137–143 Gusfield, 1997 Munro, 2001, Succinct representation of balanced parentheses and static trees, SIAM Journal on Computing, 31, 762, 10.1137/S0097539799364092 Munro, 2001, Space efficient suffix trees, Journal of Algorithms, 39, 205, 10.1006/jagm.2000.1151 Ferragina Bender, 2000, The LCA problem revisited, vol. 1776, 88 R. Raman, V. Raman, S.S. Rao, Succinct indexable dictionaries with applications to encoding k-array trees and multisets, in: Proc. ACM-SIAM SODA, 2002, pp. 233–242 A. Andersson, T. Hagerup, S. Nilsson, R. Raman, Sorting in linear time?, in: ACM Symposium on Theory of Computing, 1995, pp. 427–436 Hui, 1992, Color set size problem with applications to string matching, vol. 644, 227