Pages that link to "Item:Q414411"
From MaRDI portal
The following pages link to Sub-quadratic time and linear space data structures for permutation matching in binary strings (Q414411):
Displaying 19 items.
- Permuted scaled matching (Q294926) (← links)
- Fast algorithms for abelian periods in words and greatest common divisor queries (Q340577) (← links)
- Indexing permutations for binary strings (Q407548) (← 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)
- An \(O(n^2\log m)\)-time algorithm for the boxed-mesh permutation pattern matching problem (Q1698703) (← links)
- Permuted pattern matching algorithms on multi-track strings (Q2003324) (← links)
- Generating a Gray code for prefix normal words in amortized polylogarithmic time per word (Q2006779) (← links)
- Approximating the maximum consecutive subsums of a sequence (Q2437755) (← 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)
- On the relationship between histogram indexing and block-mass indexing (Q2955626) (← links)
- On infinite prefix normal words (Q5919082) (← links)
- Bubble-flip -- a new generation algorithm for prefix normal words (Q5970219) (← links)
