Pages that link to "Item:Q2949836"
From MaRDI portal
The following pages link to A Faster Algorithm for Computing Maximal $$\alpha $$-gapped Repeats in a String (Q2949836):
Displaying 6 items.
- 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)
- On the number of gapped repeats with arbitrary gap (Q1708025) (← links)
- Factorizing strings into repetitions (Q2135631) (← links)
- Optimal bounds for computing \({\alpha}\)-gapped repeats (Q2272989) (← links)
- Efficient representation and counting of antipower factors in words (Q5919279) (← links)
