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, Lewenstein and Valiente, pp.200-210
DOI : 10.1007/11780441_19

A. Amir, O. Kapah, and D. Tsur, Faster two dimensional pattern matching with rotations, pp.409-419
DOI : 10.1007/978-3-540-27801-6_31

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

A. Amir, D. Keselman, G. M. Landau, M. Lewenstein, N. Lewenstein et al., Text Indexing and Dictionary Matching with One Error, Journal of Algorithms, vol.37, issue.2, pp.309-325, 2000.
DOI : 10.1006/jagm.2000.1104

A. Amir, G. M. Landau, and U. Vishkin, Efficient pattern matching with scaling, Journal of Algorithms, vol.13, issue.1, pp.2-32, 1992.
DOI : 10.1016/0196-6774(92)90003-U

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

H. Chan, W. Hon, and T. W. Lam, Compressed Index for a Dynamic Collection of Texts, Sahinalp et al. [32], pp.445-456
DOI : 10.1007/978-3-540-27801-6_34

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

P. Ferragina and R. Grossi, Fast incremental text editing, SODA, pp.531-540, 1995.
DOI : 10.1007/bfb0049434

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

K. Fredriksson, G. Navarro, and E. Ukkonen, Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations, Lecture Notes in Computer Science, vol.2373, pp.235-248, 2002.
DOI : 10.1007/3-540-45452-7_20

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

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

M. Gu, M. Farach, and R. Beigel, An efficient algorithm for dynamic text indexing, SODA, pp.697-704, 1994.

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

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

M. G. Maaß and J. Nowak, Text Indexing with Errors, Lecture Notes in Computer Science, vol.3537, pp.21-32, 2005.
DOI : 10.1007/11496656_3

V. Mäkinen and G. Navarro, Dynamic entropy-compressed sequences and full-text indexes, Lewenstein and Valiente [22], pp.306-317

V. Mäkinen and G. Navarro, Position-Restricted Substring Searching, Lecture Notes in Computer Science, vol.3887, pp.703-714, 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

G. Navarro, E. Sutinen, J. Tanninen, and J. Tarhio, Indexing Text with Approximate q-Grams, Lecture Notes in Computer Science, vol.1848, pp.350-363, 2000.
DOI : 10.1007/3-540-45123-4_29

R. Pinter, Efficient string matching with dont care patterns, Combinatorial algorithms on words, NATO Advanced Science Institute Series F: Computer and System Sciences, pp.11-29, 1985.

M. S. Rahman and C. S. Iliopoulos, Indexing Factors with Gaps, Lecture Notes in Computer Science, vol.4362, pp.465-474, 2007.
DOI : 10.1007/978-3-540-69507-3_40

M. S. Rahman, C. S. Iliopoulos, I. Lee, M. Mohamed, and W. F. 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

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