A note on efficient computation of all abelian periods in a string

DOI10.1016/j.ipl.2012.11.001zbMath1259.68248arXiv1208.3313OpenAlexW1991525568WikidataQ61677856 ScholiaQ61677856MaRDI QIDQ1943614

Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Wojciech Rytter, Jakub Radoszewski, Marcin Kubica, Jakub W. Pachocki, Wojciech Tyczyński, Tomasz Walen

Publication date: 20 March 2013

Published in: Information Processing Letters (Search for Journal in Brave)

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

zbMATH Keywords

abelian periodabelian square

Mathematics Subject Classification ID

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

Related Items (11)

A note on easy and efficient computation of full abelian periods of a word ⋮ Abelian Repetitions in Sturmian Words ⋮ Fast algorithms for abelian periods in words and greatest common divisor queries ⋮ String Periods in the Order-Preserving Model ⋮ Dyck Words, Lattice Paths, and Abelian Borders ⋮ Finding patterns and periods in Cartesian tree matching ⋮ Unnamed Item ⋮ On highly palindromic words: the \(n\)-ary case ⋮ Weak abelian periodicity of infinite words ⋮ Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings ⋮ String periods in the order-preserving model

This page was built for publication: A note on efficient computation of all abelian periods in a string