P. K. Agarwal, S. Govindarajan, and S. Muthukrishnan, Range Searching in Categorical Data: Colored Range Searching on Grid, Lecture Notes in Computer Science, vol.2461, pp.17-28, 2002.
DOI : 10.1007/3-540-45749-6_6

A. Amir, Y. Aumann, G. Benson, A. Levy, O. Lipsky et al., Pattern matching with address errors, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm , SODA '06, pp.1221-1229, 2006.
DOI : 10.1145/1109557.1109692

A. Amir, A. Butman, M. Crochemore, G. M. Landau, and M. Schaps, Two-dimensional pattern matching with rotations, Theoretical Computer Science, vol.314, issue.1-2, pp.173-187, 2004.
DOI : 10.1016/j.tcs.2003.10.039

URL : https://hal.archives-ouvertes.fr/hal-00619847

A. Amir, A. Butman, and M. Lewenstein, Real scaled matching, Information Processing Letters, vol.70, issue.4, pp.185-190, 1999.
DOI : 10.1016/S0020-0190(99)00060-5

A. Amir and E. Chencinski, Faster Two Dimensional Scaled Matching, Lecture Notes in Computer Science, vol.4009, pp.200-210, 2006.
DOI : 10.1007/11780441_19

A. Amir, E. Chencinski, C. Iliopoulos, T. Kopelowitz, and H. Zhang, Property matching and weighted matching, In CPM, pp.1-15, 2006.
DOI : 10.1007/11780441_18

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.401.431

A. Amir, O. Kapah, and D. Tsur, Faster Two Dimensional Pattern Matching with Rotations, Lecture Notes in Computer Science, vol.3109, pp.409-419, 2004.
DOI : 10.1007/978-3-540-27801-6_31

URL : http://dx.doi.org/10.1016/j.tcs.2006.09.012

M. A. Bender and M. Farach-colton, The LCA Problem Revisited, Latin American Theoretical INformatics (LATIN), pp.88-94, 2000.
DOI : 10.1007/10719839_9

A. Butman, R. Eres, and G. M. Landau, Scaled and permuted string matching, Information Processing Letters, vol.92, issue.6, pp.293-297, 2004.
DOI : 10.1016/j.ipl.2004.09.002

R. Cole, L. Gottlieb, and M. Lewenstein, Dictionary matching and indexing with errors and don't cares, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing , STOC '04, pp.91-100, 2004.
DOI : 10.1145/1007352.1007374

R. Cole and R. Hariharan, Verifying candidate matches in sparse and wildcard matching, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing , STOC '02, pp.592-601, 2002.
DOI : 10.1145/509907.509992

M. Crochemore and W. Rytter, Jewels of Stringology, World Scientific, 2002.
DOI : 10.1142/4838

URL : https://hal.archives-ouvertes.fr/hal-00619795

M. Farach, Optimal suffix tree construction with large alphabets, Proceedings 38th Annual Symposium on Foundations of Computer Science, pp.137-143, 1997.
DOI : 10.1109/SFCS.1997.646102

M. Fischer and M. Paterson, String matching and other products, SIAM AMS Proceedings, pp.113-125, 1974.

H. Gabow, J. Bentley, and R. 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

D. Gusfield, Algorithms on Strings, Trees, and Sequences -Computer Science and Computational Biology, 1997.

D. S. Hirschberg, Algorithms for the Longest Common Subsequence Problem, Journal of the ACM, vol.24, issue.4, pp.664-675, 1977.
DOI : 10.1145/322033.322044

J. Jurka, Human repetitive elements, Molecular Biology and Biotechnology
DOI : 10.1016/j.gde.2004.08.008

J. Jurka, Origin and evolution of alu repetitive elements The impact of short interspersed elements (SINEs) on the host genome

V. Levenshtein, Binary codes capable of correcting, deletions, insertions and reversals, Soviet Phys. Dokl, vol.10, pp.707-710, 1966.

V. Mäkinen and G. Navarro, Position-Restricted Substring Searching, LATIN, pp.1-12, 2006.
DOI : 10.1007/11682462_64

E. M. Mccreight, A Space-Economical Suffix Tree Construction Algorithm, Journal of the ACM, vol.23, issue.2, pp.262-272, 1976.
DOI : 10.1145/321941.321946

M. S. Rahman, C. Iliopoulos, I. Lee, M. Mohamed, and W. Smyth, Finding Patterns with Variable Length Gaps or Don???t Cares, Lecture Notes in Computer Science, vol.4112, pp.146-155, 2006.
DOI : 10.1007/11809678_17

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.65.6302

K. Sadakane, Succinct data structures for flexible text retrieval systems, Journal of Discrete Algorithms, vol.5, issue.1, pp.12-22, 2007.
DOI : 10.1016/j.jda.2006.03.011

E. Ukkonen, On-line construction of suffix trees, Algorithmica, vol.10, issue.3, pp.249-260, 1995.
DOI : 10.1007/BF01206331