A. Amir, P. Charalampopoulos, P. Solon, J. Pissis, and . Radoszewski, Longest common factor made fully dynamic, 2018.

A. K. Lorraine, C. Ayad, P. Barton, C. S. Charalampopoulos, S. P. Iliopoulos et al., Longest common prefixes with k-errors and applications, SPIRE, volume 11147 of LNCS, pp.27-41, 2018.

I. Sang-won-bae and . Lee, On finding a longest common palindromic subsequence, Advances in Algorithms & Combinatorics on Strings (Honoring 60th birthday for Prof. Costas S. Iliopoulos), vol.710, pp.29-34, 2018.

H. Bannai, I. Tomohiro, S. Inenaga, Y. Nakashima, M. Takeda et al., The "runs" theorem, SIAM Journal on Computing, vol.46, issue.5, pp.1501-1514, 2017.

C. Barton, T. Kociumaka, C. Liu, P. Solon, J. Pissis et al., Indexing weighted sequences: Neat and efficient, 2017.

D. Belazzougui and F. Cunial, Indexed matching statistics and shortest unique substrings, 21st International Symposium on String Processing and Information Retrieval, vol.8799, pp.179-190, 2014.

W. I. Chang and E. L. Lawler, Sublinear approximate string matching and biological applications, Algorithmica, vol.12, issue.4, pp.327-344, 1994.

P. Charalampopoulos, M. Crochemore, C. S. Iliopoulos, T. Kociumaka, P. Solon et al., Linear-time algorithm for long LCF with k mismatches, 16. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, vol.23, pp.1-23, 2018.

P. Charalampopoulos, S. Costas, C. Iliopoulos, S. P. Liu, and . Pissis, Property suffix array with applications

. Mosteiro, LATIN 2018: Theoretical Informatics-13th Latin American Symposium, vol.10807, pp.290-302, 2018.

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

M. Shihabur-rahman-chowdhury, S. Hasan, M. Iqbal, and . Sohel-rahman, Computing a longest common palindromic subsequence, Fundam. Inf, vol.129, issue.4, pp.329-340, 2014.

M. Dumitran, F. Manea, and D. Nowotka, On prefix/suffix-square free words, 22nd International Symposium, on String Processing and Information Retrieval, vol.9309, pp.54-66, 2015.

J. Duval, R. Kolpakov, G. Kucherov, T. Lecroq, and A. Lefebvre, Linear-time computation of local periods, Theoretical Computer Science, vol.326, issue.1, pp.229-240, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00099598

M. Farach, Optimal suffix tree construction with large alphabets, 38th Annual Symposium on Foundations of Computer Science (FOCS), pp.137-143, 1997.

M. Farach and S. Muthukrishnan, Perfect hashing for strings: Formalization and algorithms, 7th Symposium on Combinatorial Pattern Matching (CPM), pp.130-140, 1996.

M. Federico and N. Pisanti, Suffix tree characterization of maximal motifs in biological sequences, Theor. Comput. Sci, vol.410, issue.43, pp.4391-4401, 2009.

M. Funakoshi, Y. Nakashima, S. Inenaga, H. Bannai, and M. Takeda, Longest substring palindrome after edit, Annual Symposium on Combinatorial Pattern Matching (CPM 2018), volume 105 of Leibniz International Proceedings in Informatics (LIPIcs), vol.12, pp.1-12, 2018.

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

S. Inenaga and H. Hyyrö, A hardness result and new algorithm for the longest common palindromic subsequence problem, Information Processing Letters, vol.129, pp.11-15, 2018.

T. Inoue, S. Inenaga, H. Hyyrö, H. Bannai, and M. Takeda, Computing longest common square subsequences, 29th Symposium on Combinatorial Pattern Matching (CPM), volume 105 of LIPIcs, vol.15, pp.1-15, 2018.

T. Kociumaka, T. A. Starikovskaya, and H. Vildhøj, Sublinear space algorithms for the longest common substring problem, Algorithms-ESA 2014-22th Annual European Symposium, pp.605-617, 2014.
DOI : 10.1007/978-3-662-44777-2_50
URL : http://arxiv.org/pdf/1407.0522.pdf

R. Kolpakov and G. Kucherov, Finding maximal repetitions in a word in linear time, 40th Symposium on Foundations of Comp Science, pp.596-604, 1999.
DOI : 10.1109/sffcs.1999.814634
URL : https://hal.archives-ouvertes.fr/inria-00098853

M. Lothaire, Applied Combinatorics on Words. Encyclopedia of Mathematics and its Applications, 2005.
DOI : 10.1017/cbo9781107341005
URL : https://hal.archives-ouvertes.fr/hal-00620607

P. Peterlongo, N. Pisanti, F. Boyer, A. Pereira-do-lago, and M. Sagot, Lossless filter for multiple repetitions with hamming distance, J. Discr. Alg, vol.6, issue.3, pp.497-509, 2008.
DOI : 10.1016/j.jda.2007.03.003
URL : https://hal.archives-ouvertes.fr/inria-00179731

P. Peterlongo, N. Pisanti, F. Boyer, and M. Sagot, Lossless filter for finding long multiple approximate repetitions using a new data structure, the bi-factor array, 12th International Symposium String Processing and Information Retrieval, 12th International Conference (SPIRE), pp.179-190, 2005.
DOI : 10.1007/11575832_20
URL : https://hal.archives-ouvertes.fr/inria-00328129

T. A. Starikovskaya and . Vildhøj, Time-space trade-offs for the longest common substring problem, 24th Symposium on Combinatorial Pattern Matching (CPM), pp.223-234, 2013.
DOI : 10.1007/978-3-642-38905-4_22
URL : http://hwv.dk/pdfs/timespacetradeoffsforthelongestcommonsubstringproblem.pdf

V. Sharma, C. Thankachan, . Aluru, P. Sriram, S. Chockalingam et al., Algorithmic framework for approximate matching under bounded edits with applications to sequence analysis, RECOMB, vol.10812, pp.211-224, 2018.

V. Sharma, A. Thankachan, S. Apostolico, and . Aluru, A provably efficient algorithm for the k-mismatch average common substring problem, Journal of Computational Biology, vol.23, issue.6, pp.472-482, 2016.