Pages that link to "Item:Q407548"
From MaRDI portal
The following pages link to Indexing permutations for binary strings (Q407548):
Displayed 12 items.
- Fast algorithms for abelian periods in words and greatest common divisor queries (Q340577) (← links)
- Sub-quadratic time and linear space data structures for permutation matching in binary strings (Q414411) (← links)
- Algorithms for computing abelian periods of words (Q496544) (← links)
- Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings (Q507391) (← 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)
- Binary jumbled pattern matching on trees and tree-like structures (Q893318) (← links)
- New algorithms for binary jumbled pattern matching (Q2444765) (← links)
- Binary jumbled string matching for highly run-length compressible texts (Q2444848) (← links)
- Algorithms for Longest Common Abelian Factors (Q2833540) (← links)
- Orthogonal Range Searching for Text Indexing (Q2848980) (← links)