Pages that link to "Item:Q692932"
From MaRDI portal
The following pages link to On approximate jumbled pattern matching in strings (Q692932):
Displaying 20 items.
- Permuted scaled matching (Q294926) (← 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 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)
- Finding patterns and periods in Cartesian tree matching (Q2207506) (← links)
- Improved online algorithms for jumbled matching (Q2295624) (← links)
- Approximating the maximum consecutive subsums of a sequence (Q2437755) (← links)
- Binary jumbled string matching for highly run-length compressible texts (Q2444848) (← links)
- Computing abelian complexity of binary uniform morphic words (Q2629230) (← links)
- Algorithms for jumbled pattern matching in strings (Q2909200) (← links)
- On the relationship between histogram indexing and block-mass indexing (Q2955626) (← links)
- (Q5016359) (← links)
- Cartesian Tree Matching and Indexing (Q5088906) (← links)
- (Q5874401) (← links)
- On infinite prefix normal words (Q5919082) (← links)
- Dyck Words, Lattice Paths, and Abelian Borders (Q6114866) (← links)
