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

J. Karhumäki and S. Puzynina, On k-Abelian Palindromic Rich and Poor Words, pp.191-202
DOI : 10.1007/978-3-319-09698-8_17

S. Subramanian, S. Chaparala, V. Avali, K. Madhavi, and . Ganapathiraju, A pilot study on the prevalence of DNA palindromes in breast cancer genomes, BMC Medical Genomics, vol.141, issue.S3, p.73, 2016.
DOI : 10.1002/ajmg.b.30242

?. Holub and K. Saari, On highly palindromic words, Discrete Applied Mathematics, vol.157, issue.5, pp.953-959, 2009.
DOI : 10.1016/j.dam.2008.03.039
URL : https://doi.org/10.1016/j.dam.2008.03.039