The following pages link to (Q3024804):
Displaying 13 items.
- Reporting consecutive substring occurrences under bounded gap constraints (Q294948) (← links)
- Counting maximal-exponent factors in words (Q728262) (← links)
- Computing maximal-exponent factors in an overlap-free word (Q899581) (← links)
- Discovering subword associations in strings in time linear in the output size (Q1026231) (← links)
- On maximal repeats in strings (Q1603378) (← links)
- Improved upper bounds on all maximal \(\alpha\)-gapped repeats and palindromes (Q1625598) (← 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)
- Algorithms for extracting motifs from biological weighted sequences (Q2457295) (← links)
- Reporting Consecutive Substring Occurrences Under Bounded Gap Constraints (Q2942274) (← links)
- Longest Gapped Repeats and Palindromes (Q2946337) (← links)
- Longest $$\alpha $$-Gapped Repeat and Palindrome (Q2947867) (← links)
- A Faster Algorithm for Computing Maximal $$\alpha $$-gapped Repeats in a String (Q2949836) (← links)
- Small-space LCE data structure with constant-time queries (Q5111224) (← links)
