Pages that link to "Item:Q2957888"
From MaRDI portal
The following pages link to Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries (Q2957888):
Displaying 13 items.
- Permuted scaled matching (Q294926) (← links)
- A note on easy and efficient computation of full abelian periods of a word (Q313772) (← links)
- Fast algorithms for abelian periods in words and greatest common divisor queries (Q340577) (← links)
- Algorithms for computing abelian periods of words (Q496544) (← links)
- Weak abelian periodicity of infinite words (Q504987) (← links)
- Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings (Q507391) (← links)
- Fast computation of abelian runs (Q507408) (← links)
- A note on efficient computation of all abelian periods in a string (Q1943614) (← links)
- On highly palindromic words: the \(n\)-ary case (Q2231750) (← links)
- String Periods in the Order-Preserving Model (Q3304137) (← links)
- (Q5016359) (← links)
- Abelian Repetitions in Sturmian Words (Q5300843) (← links)
- Dyck Words, Lattice Paths, and Abelian Borders (Q6114866) (← links)