A note on easy and efficient computation of full abelian periods of a word

DOI10.1016/j.dam.2015.09.024zbMath1352.68199arXiv1510.00634OpenAlexW2109612762MaRDI QIDQ313772

W. F. Smyth, Élise Prieur-Gaston, Arnaud Lefebvre, Thierry Lecroq, Gabriele Fici

Publication date: 12 September 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.00634

zbMATH Keywords

abelian powertext algorithmsfull abelian periodweak repetition

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Related Items

String Periods in the Order-Preserving Model ⋮ String periods in the order-preserving model

Cites Work

• Unnamed Item
• Unnamed Item
• Algorithms for computing abelian periods of words
• A note on efficient computation of all abelian periods in a string
• Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries
• IDENTIFYING ALL ABELIAN PERIODS OF A STRING IN QUADRATIC TIME AND RELEVANT PROBLEMS
• Algorithm and bound for the greatest common divisor of n integers