The following pages link to \(k\)-abelian pattern matching (Q491150):
Displaying 8 items.
- A note on easy and efficient computation of full abelian periods of a word (Q313772) (← links)
- On cardinalities of \(k\)-abelian equivalence classes (Q728280) (← links)
- \(k\)-difference matching in amortized linear time for all the words in a text (Q1006084) (← links)
- Popping Superbubbles and Discovering Clumps: Recent Developments in Biological Sequence Analysis (Q2803803) (← links)
- k-Abelian Equivalence and Rationality (Q2817377) (← links)
- k-Abelian Pattern Matching (Q2921982) (← links)
- Absent Subsequences in Words (Q6070611) (← links)
- Regularity of k-Abelian Equivalence Classes of Fixed Cardinality (Q6163617) (← links)
