The following pages link to String powers in trees (Q1679231):
Displaying 9 items.
- Efficiently computing runs on a trie (Q820550) (← links)
- String covers of a tree (Q2146126) (← links)
- Lower bounds for the number of repetitions in 2D strings (Q2146138) (← links)
- String Powers in Trees (Q2942264) (← links)
- NUMBER OF OCCURRENCES OF POWERS IN STRINGS (Q3586403) (← links)
- (Q4738287) (← links)
- Computing runs on a trie (Q5088914) (← links)
- Tight bound for the number of distinct palindromes in a tree (Q6042101) (← links)
- String covers of a tree revisited (Q6545440) (← links)