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
Real scaled matching, Information Processing Letters, vol.70, issue.4, pp.185-190, 1999. ,
DOI : 10.1016/S0020-0190(99)00060-5
Faster two dimensional scaled matching, Lewenstein and Valiente, pp.200-210 ,
Faster two dimensional pattern matching with rotations, pp.409-419 ,
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
Efficient pattern matching with scaling, Journal of Algorithms, vol.13, issue.1, pp.2-32, 1992. ,
DOI : 10.1016/0196-6774(92)90003-U
The LCA Problem Revisited, Latin American Theoretical INformatics (LATIN), pp.88-94, 2000. ,
DOI : 10.1007/10719839_9
Scaled and permuted string matching, Information Processing Letters, vol.92, issue.6, pp.293-297, 2004. ,
DOI : 10.1016/j.ipl.2004.09.002
Compressed Index for a Dynamic Collection of Texts, Sahinalp et al. [30], pp.445-456 ,
DOI : 10.1007/978-3-540-27801-6_34
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
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
Jewels of Stringology, World Scientific, 2002. ,
DOI : 10.1142/4838
URL : https://hal.archives-ouvertes.fr/hal-00619795
Fast incremental text editing, SODA, pp.531-540, 1995. ,
String matching and other products, SIAM AMS Proceedings, pp.113-125, 1974. ,
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
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
An efficient algorithm for dynamic text indexing, SODA, pp.697-704, 1994. ,
Algorithms on Strings, Trees, and Sequences -Computer Science and Computational Biology, 1997. ,
Algorithms for the Longest Common Subsequence Problem, Journal of the ACM, vol.24, issue.4, pp.664-675, 1977. ,
DOI : 10.1145/322033.322044
Binary codes capable of correcting, deletions, insertions and reversals, Soviet Phys. Dokl, vol.10, pp.707-710, 1966. ,
Text Indexing with Errors, Lecture Notes in Computer Science, vol.3537, pp.21-32, 2005. ,
DOI : 10.1007/11496656_3
Dynamic entropy-compressed sequences and full-text indexes, Lewenstein and Valiente [21], pp.306-317 ,
Position-Restricted Substring Searching, Lecture Notes in Computer Science, vol.3887, pp.703-714, 2006. ,
DOI : 10.1007/11682462_64
A Space-Economical Suffix Tree Construction Algorithm, Journal of the ACM, vol.23, issue.2, pp.262-272, 1976. ,
DOI : 10.1145/321941.321946
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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.1391
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. ,
Indexing Factors with Gaps, Lecture Notes in Computer Science, vol.4362, pp.465-474, 2007. ,
DOI : 10.1007/978-3-540-69507-3_40
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
On-line construction of suffix trees, Algorithmica, vol.10, issue.3, pp.249-260, 1995. ,
DOI : 10.1007/BF01206331