Pages that link to "Item:Q899581"
From MaRDI portal
The following pages link to Computing maximal-exponent factors in an overlap-free word (Q899581):
Displaying 3 items.
- Efficient computation of maximal anti-exponent in palindrome-free strings (Q507406) (← links)
- Counting maximal-exponent factors in words (Q728262) (← links)
- 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 (Q1702853) (← links)