Pages that link to "Item:Q2444765"
From MaRDI portal
The following pages link to New algorithms for binary jumbled pattern matching (Q2444765):
Displaying 13 items.
- 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)
- 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)
- Generating a Gray code for prefix normal words in amortized polylogarithmic time per word (Q2006779) (← links)
- Improved online algorithms for jumbled matching (Q2295624) (← links)
- Binary Jumbled Pattern Matching on Trees and Tree-Like Structures (Q2849342) (← links)
- Algorithms for jumbled pattern matching in strings (Q2909200) (← links)
- (Q5140739) (← links)
- On infinite prefix normal words (Q5919082) (← links)
- Bubble-flip -- a new generation algorithm for prefix normal words (Q5970219) (← links)