Pages that link to "Item:Q4923285"

The following pages link to IDENTIFYING ALL ABELIAN PERIODS OF A STRING IN QUADRATIC TIME AND RELEVANT PROBLEMS (Q4923285):

Displaying 11 items.

• 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)
• A note on efficient computation of all abelian periods in a string (Q1943614) (← links)
• On highly palindromic words: the \(n\)-ary case (Q2231750) (← links)
• Abelian borders in binary words (Q2449116) (← links)
• Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries (Q2957888) (← links)
• Abelian Repetitions in Sturmian Words (Q5300843) (← links)
• (Q6075975) (← links)