J. L. Bentley, Multidimensional divide-and-conquer, Communications of the ACM, vol.23, issue.4, pp.214-229, 1980.
DOI : 10.1145/358841.358850

T. M. Chan, Persistent Predecessor Search and Orthogonal Point Location on the Word RAM, ACM-SIAM Symposium on Discrete Algorithms, pp.1131-1145, 2011.

L. Hui, Color set size problem with applications to string matching, Combinatorial Pattern Matching, pp.230-243, 1992.

A. Fadiel, S. Lithwick, G. Ganji, and S. W. Scherer, Remarkable sequence signatures in archaeal genomes, Archaea, vol.281, issue.3, pp.185-190, 2003.
DOI : 10.1155/2003/458235

M. Farach and M. Muthukrishnan, Perfect hashing for strings: Formalization and algorithms, Combinatorial Pattern Matching, pp.130-140, 1996.
DOI : 10.1007/3-540-61258-0_11

M. L. Fredman and D. E. Willard, Trans-dichotomous algorithms for minimum spanning trees and shortest paths, Journal of Computer and System Sciences, vol.48, issue.3, pp.533-551, 1994.
DOI : 10.1016/S0022-0000(05)80064-9

H. N. Gabow, J. L. Bentley, and R. E. Tarjan, Scaling and related techniques for geometry problems, Proceedings of the sixteenth annual ACM symposium on Theory of computing , STOC '84, pp.135-143, 1984.
DOI : 10.1145/800057.808675

A. Golynski, J. I. Munro, and S. S. Rao, Rank/select operations on large alphabets, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm , SODA '06, pp.368-373, 2006.
DOI : 10.1145/1109557.1109599

J. Jájá, C. W. Mortensen, and Q. Shi, Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting, Proceedings of the 15th International Symposium on Algorithms and Computation, pp.558-568, 2004.
DOI : 10.1007/978-3-540-30551-4_49

Y. Matias, J. S. Vitter, and N. E. Young, Approximate data structures with applications, Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.187-194, 1994.

S. and M. Muthukrishnan, Efficient algorithms for document retrieval problems, Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '02, 2002.

Y. Nekrich, I/O-Efficient Point Location in a Set of Rectangles, Procedings of the 8th Latin American Symposium on Theoretical Informatics, pp.687-698, 2008.
DOI : 10.1007/978-3-540-78773-0_59

B. Schieber and U. Vishkin, On finding lowest common ancestors: Simplification and parallelization, SIAM Journal on Computing, vol.17, pp.111-123, 1988.

M. Tompa, Assessing computational tools for the discovery of transcription factor binding sites, Nature Biotechnology, vol.5, issue.1, pp.137-144, 2005.
DOI : 10.1002/prot.10556