Algorithms for computing abelian periods of words

DOI10.1016/j.dam.2013.08.021zbMath1329.68197arXiv1211.5389OpenAlexW2026696944MaRDI QIDQ496544

Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston, Gabriele Fici

Publication date: 22 September 2015

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

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

zbMATH Keywords

design of algorithmscombinatorics on wordsabelian periodtext algorithmsweak repetitionabelian repetition

Mathematics Subject Classification ID

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

Related Items

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, Abelian-primitive partial words, Dyck Words, Lattice Paths, and Abelian Borders, Unnamed Item, On highly palindromic words: the \(n\)-ary case, Computing regularities in strings: a survey, String periods in the order-preserving model

Cites Work

• Indexing permutations for binary strings
• Sub-quadratic time and linear space data structures for permutation matching in binary strings
• On approximate jumbled pattern matching in strings
• New algorithms for binary jumbled pattern matching
• Binary jumbled string matching for highly run-length compressible texts
• ALGORITHMS FOR JUMBLED PATTERN MATCHING IN STRINGS
• Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries
• Abelian Repetitions in Sturmian Words
• Unnamed Item
• Unnamed Item
• Unnamed Item