Computing maximal-exponent factors in an overlap-free word
From MaRDI portal
Publication:899581
DOI10.1016/J.JCSS.2015.11.007zbMATH Open1333.68303DBLPjournals/jcss/BadkobehC16OpenAlexW2185072808WikidataQ61677825 ScholiaQ61677825MaRDI QIDQ899581FDOQ899581
Authors: Golnaz Badkobeh, Maxime Crochemore 
Publication date: 30 December 2015
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://research.gold.ac.uk/id/eprint/22721/1/MaxExpFac.pdf
Recommendations
Cites Work
- Algorithms on Strings, Trees and Sequences
- A universal algorithm for sequential data compression
- Title not available (Why is that?)
- Algorithms on Strings
- Efficient seeds computation revisited
- The ``runs conjecture
- Covering a string
- The subtree max gap problem with application to parallel string covering
- Title not available (Why is that?)
- A characterization of Sturmian words by return words
- Maximal repetitions in strings
- Sur un théorème de Thue
- A proof of Dejean’s conjecture
- Title not available (Why is that?)
- Last cases of Dejean's conjecture
- Computing longest previous non-overlapping factors
- The number of runs in a string
- On maximal repetitions of arbitrary exponent
- Finite repetition threshold for large alphabets
Cited In (5)
- Tighter bounds and optimal algorithms for all maximal \(\alpha\)-gapped repeats and palindromes. Finding all maximal \(\alpha\)-gapped repeats and palindromes in optimal worst case time on integer alphabets
- Counting maximal-exponent factors in words
- The complexity of computing maximal word functions
- Efficient representation and counting of antipower factors in words
- Efficient computation of maximal anti-exponent in palindrome-free strings
This page was built for publication: Computing maximal-exponent factors in an overlap-free word
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q899581)
