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

DOI10.1016/J.DAM.2015.09.024zbMATH Open1352.68199arXiv1510.00634OpenAlexW2109612762MaRDI QIDQ313772FDOQ313772

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

Publication date: 12 September 2016

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

Abstract: Constantinescu and Ilie (Bulletin of the EATCS 89, 167-170, 2006) introduced the idea of an Abelian period with head and tail of a finite word. An Abelian period is called full if both the head and the tail are empty. We present a simple and easy-to-implement $O(nloglogn)$-time algorithm for computing all the full Abelian periods of a word of length $n$ over a constant-size alphabet. Experiments show that our algorithm significantly outperforms the $O(n)$ algorithm proposed by Kociumaka et al. (Proc. of STACS, 245-256, 2013) for the same problem.

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)

Cites Work

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

Cited In (3)

• String Periods in the Order-Preserving Model
• String periods in the order-preserving model
• Abelian periods, partial words, and an extension of a theorem of Fine and Wilf

   Recommendations

• Online Computation of Abelian Runs 👍 👎
• Fast computation of abelian runs 👍 👎
• Algorithms for computing abelian periods of words 👍 👎
• An abelian periodicity lemma 👍 👎
• 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 👍 👎
• Fast algorithms for abelian periods in words and greatest common divisor queries 👍 👎
• Inferring Strings from Full Abelian Periods 👍 👎
• A note on efficient computation of all abelian periods in a string 👍 👎
• \(k\)-abelian pattern matching 👍 👎

This page was built for publication: A note on easy and efficient computation of full abelian periods of a word

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q313772)