Résumé : The analysis of repetition in strings constitutes a fundamental area of combinatorics on words due to important applications to text algorithms, data compression, music analysis, and biological sequences analysis, to quote a few. The talk surveys algorithmic methods used to locate repetitive segments in strings. It discusses the notion of runs that encompasses various types of periodicities considered by different authors. The analysis of related algorithms raises interesting combinatorial questions and conjectures.
|Dernière modification : mardi 09 janvier 2018||Organisateurs : Cyril.Banderier & Gerard.Duchamp at lipn.univ-paris13.fr|