Pages that link to "Item:Q1943614"

The following pages link to A note on efficient computation of all abelian periods in a string (Q1943614):

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)
• Weak abelian periodicity of infinite words (Q504987) (← links)
• Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings (Q507391) (← links)
• Finding patterns and periods in Cartesian tree matching (Q2207506) (← links)
• On highly palindromic words: the \(n\)-ary case (Q2231750) (← links)
• String periods in the order-preserving model (Q2288212) (← 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)