Pages that link to "Item:Q2798724"
From MaRDI portal
The following pages link to Optimal Bounds for Computing $$\alpha $$ α -gapped Repeats (Q2798724):
Displayed 10 items.
- Upper bounds on distinct maximal (sub-)repetitions in compressed strings (Q832954) (← links)
- Improved upper bounds on all maximal \(\alpha\)-gapped repeats and palindromes (Q1625598) (← links)
- Searching of gapped repeats and subrepetitions in a word (Q1679608) (← 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)
- Some results on the number of periodic factors in words (Q2288207) (← links)
- The undirected repetition threshold and undirected pattern avoidance (Q2662683) (← links)
- Small-space LCE data structure with constant-time queries (Q5111224) (← links)
- Efficient representation and counting of antipower factors in words (Q5919279) (← links)
- Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings (Q6169968) (← links)