M. A. Bender and M. Farach-colton, The LCA problem revisited, Latin American Symposium on Theoretical Informatics, vol.1776, pp.88-94, 2000.

M. Crochemore, C. Hancart, and T. Lecroq, Algorithms on Strings, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00470109

C. Defant, Anti-power prefixes of the thue-morse word, 2016.

P. Erd?s, Anti-ramsey theorems, 1973.

S. Fujita, C. Magnant, and K. Ozeki, Rainbow generalizations of ramsey theory: a survey, Graphs and Combinatorics, vol.26, issue.1, pp.1-30, 2010.

R. Kolpakov, G. Bana, and G. Kucherov, mreps: efficient and flexible detection of tandem repeats in dna, Nucleic acids research, vol.31, issue.13, pp.3672-3678, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00099597

E. M. Mccreight, A space-economical suffix tree construction algorithm, Journal of the ACM (JACM), vol.23, issue.2, pp.262-272, 1976.

S. Narayanan, Functions on antipower prefix lengths of the thue-morse word, 2017.

A. Thue, Uber unendliche zeichenreihen, Norske Vid Selsk. Skr. I Mat-Nat Kl.(Christiana), vol.7, pp.1-22, 1906.

E. Ukkonen, Constructing suffix trees on-line in linear time, Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture-Information Processing'92, vol.1, pp.484-492, 1992.

P. Weiner, Linear pattern matching algorithms, 14th Annual Symposium on Switching and Automata Theory (swat 1973), pp.1-11, 1973.

D. J. Wurpel, S. A. Beatson, M. Totsika, N. K. Petty, and M. A. Schembri, Chaperoneusher fimbriae of escherichia coli, PloS one, vol.8, issue.1, p.52835, 2013.