Pages that link to "Item:Q4601891"
From MaRDI portal
The following pages link to Efficiently Finding All Maximal alpha-gapped Repeats (Q4601891):
Displaying 12 items.
- Counting maximal-exponent factors in words (Q728262) (← links)
- Upper bounds on distinct maximal (sub-)repetitions in compressed strings (Q832954) (← 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)
- Formulas with reversal (Q2011639) (← links)
- Optimal bounds for computing \({\alpha}\)-gapped repeats (Q2272989) (← links)
- Some results on the number of periodic factors in words (Q2288207) (← links)
- Finding Gapped Palindromes Online (Q2819503) (← links)
- Computing Longest Single-arm-gapped Palindromes in a String (Q2971149) (← links)
- Small-space LCE data structure with constant-time queries (Q5111224) (← links)
- Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings (Q6169968) (← links)
