Pages that link to "Item:Q3401100"
From MaRDI portal
The following pages link to Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays (Q3401100):
Displayed 10 items.
- Extracting powers and periods in a word from its runs structure (Q389938) (← links)
- Parameterized longest previous factor (Q441845) (← links)
- New simple efficient algorithms computing powers and runs in strings (Q496538) (← links)
- Searching for gapped palindromes (Q1038475) (← 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)
- Computing longest previous non-overlapping factors (Q1944092) (← links)
- Efficient computation of longest single-arm-gapped palindromes in a string (Q2297859) (← links)
- Longest Gapped Repeats and Palindromes (Q2946337) (← links)
- Longest $$\alpha $$-Gapped Repeat and Palindrome (Q2947867) (← links)
- On Prefix/Suffix-Square Free Words (Q2949834) (← links)