Counting maximal-exponent factors in words

DOI10.1016/J.TCS.2016.02.035zbMath1370.68239OpenAlexW2288701678WikidataQ61677821 ScholiaQ61677821MaRDI QIDQ728262

Maxime Crochemore, Robert Mercaş, Golnaz Badkobeh

Publication date: 19 December 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.02.035

zbMATH Keywords

combinatorics on wordsmaximal-exponent factorword exponent

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• Unnamed Item
• The ``runs conjecture
• Algorithmic aspects of bioinformatics. Translated from the German original
• Computing maximal-exponent factors in an overlap-free word
• A characterization of the squares in a Fibonacci string
• The number of runs in a string
• Longest Gapped Repeats and Palindromes
• A Faster Algorithm for Computing Maximal $$\alpha $$-gapped Repeats in a String
• Algorithms on Strings, Trees and Sequences
• Efficiently Finding All Maximal alpha-gapped Repeats
• Searching of Gapped Repeats and Subrepetitions in a Word
• A new characterization of maximal repetitions by Lyndon trees

This page was built for publication: Counting maximal-exponent factors in words