The following pages link to Scaled and permuted string matching (Q834966):
Displaying 12 items.
- Permuted scaled matching (Q294926) (← links)
- Efficient indexes for jumbled pattern matching with constant-sized alphabet (Q524375) (← links)
- On approximate jumbled pattern matching in strings (Q692932) (← links)
- On prefix normal words and prefix normal forms (Q729994) (← links)
- Approximating the maximum consecutive subsums of a sequence (Q2437755) (← links)
- New algorithms for binary jumbled pattern matching (Q2444765) (← links)
- Computing abelian complexity of binary uniform morphic words (Q2629230) (← links)
- Double string tandem repeats (Q2700385) (← links)
- Orthogonal Range Searching for Text Indexing (Q2848980) (← links)
- ALGORITHMS FOR JUMBLED PATTERN MATCHING IN STRINGS (Q2909200) (← links)
- (Q5016359) (← links)
- Dyck Words, Lattice Paths, and Abelian Borders (Q6114866) (← links)
