A. Andersson, J. Larsson, and K. Swanson, Suffix trees on words, Proc. of the 7th Annual Symposium on Combinatorial Pattern Matching (CPM'96), pp.102-115, 1996.
DOI : 10.1007/3-540-61258-0_9

T. M. Chan, . Kasper-green-larsen, P. Mihai, and . Atras¸cuatras¸cu, Orthogonal range searching on the RAM, revisited, Proceedings of the 27th annual ACM symposium on Computational geometry, SoCG '11, pp.1-10, 2011.
DOI : 10.1145/1998196.1998198

Y. Chien, W. Hon, R. Shah, and J. Vitter, Geometric Burrows-Wheeler Transform: Linking Range Searching and Text Indexing, Data Compression Conference (dcc 2008), pp.252-261, 2008.
DOI : 10.1109/DCC.2008.67
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.155.553

P. Ferragina and J. Fischer, Suffix Arrays on Words, Proceedings of the 18th Annual Symposium on Combinatorial Pattern Matching, pp.328-339, 2007.
DOI : 10.1007/978-3-540-73437-6_33

P. Ferragina, G. Manzini, V. Makinen, and G. Navarro, Compressed representations of sequences and full-text indexes, ACM Transactions on Algorithms, vol.3, issue.2, 2007.
DOI : 10.1145/1240233.1240243

W. Hon, R. Shah, . Sh, V. Thankachan, and . Vitter, On Entropy-Compressed Text Indexing in External Memory, Proc. 16th Int. Symp. String Processing and Information Retrieval, pp.75-89, 2009.
DOI : 10.1016/S0196-6774(03)00087-7

W. Hon, R. Shah, and J. Vitter, Ordered pattern matching: Towards full-text retrieval, 2006.

S. Inenaga and M. Takeda, On-Line Linear-Time Construction of Word Suffix Trees, Proc. 17th Ann. Symp. on Combinatorial Pattern Matching (CPM06, pp.60-71
DOI : 10.1007/11780441_7

J. Kärkkäinen and E. Ukkonen, Sparse suffix trees, Proc. 2nd Annual International Computing and Combinatorics Conference (COCOON'96), pp.219-230, 1996.
DOI : 10.1007/3-540-61332-3_155

V. Mäkinen and G. Navarro, Position-Restricted Substring Searching, Proc. 7th Latin American Symposium on Theoretical Informatics (LATIN), pp.703-714, 2006.
DOI : 10.1007/11682462_64

Y. Nekrich, Orthogonal range searching in linear and almost-linear space, Computational Geometry, vol.42, issue.4, pp.342-351, 2009.
DOI : 10.1016/j.comgeo.2008.09.001

T. Uemura and H. Arimura, Sparse and Truncated Suffix Trees on Variable-Length Codes, In CPM, vol.14, issue.3, pp.246-260, 2011.
DOI : 10.1007/BF01206331

C. Yu, W. Hon, and B. Wang, Efficient Data Structures for the Orthogonal Range Successor Problem, Proceedings of the 15th Annual International Conference on Computing and Combinatorics, COCOON '09, pp.96-105, 2009.
DOI : 10.1007/978-1-4612-1098-6