Efficient indexes for jumbled pattern matching with constant-sized alphabet
From MaRDI portal
Publication:2849352
Recommendations
- Efficient indexes for jumbled pattern matching with constant-sized alphabet
- New algorithms for binary jumbled pattern matching
- Binary jumbled string matching for highly run-length compressible texts
- On hardness of jumbled indexing
- Fast and simple jumbled indexing for binary run-length encoded strings
Cited in
(18)- \(k\)-abelian pattern matching
- Algorithms for jumbled pattern matching in strings
- Efficient indexes for the positional pattern matching problem and two related problems over small alphabets
- On hardness of jumbled indexing
- Weighted prefix normal words: mind the gap
- Real-Time Streaming Multi-Pattern Search for Constant Alphabet
- General space-time tradeoffs via relational queries
- Fast and simple jumbled indexing for binary run-length encoded strings
- A Linear Size Index for Approximate Pattern Matching
- Indexed geometric jumbled pattern matching
- On prefix normal words and prefix normal forms
- Binary jumbled pattern matching on trees and tree-like structures
- Efficient indexes for jumbled pattern matching with constant-sized alphabet
- Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings
- CSA++: Fast Pattern Search for Large Alphabets
- Fast algorithms for abelian periods in words and greatest common divisor queries
- Permuted scaled matching
- New algorithms for binary jumbled pattern matching
This page was built for publication: Efficient indexes for jumbled pattern matching with constant-sized alphabet
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849352)
