Efficient indexes for jumbled pattern matching with constant-sized alphabet
From MaRDI portal
Publication:2849352
DOI10.1007/978-3-642-40450-4_53zbMATH Open1364.68380OpenAlexW161072239MaRDI QIDQ2849352FDOQ2849352
Authors: Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter 
Publication date: 17 September 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40450-4_53
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 (14)
- Weighted prefix normal words: mind the gap
- Permuted scaled matching
- On prefix normal words and prefix normal forms
- General space-time tradeoffs via relational queries
- A Linear Size Index for Approximate Pattern Matching
- Fast algorithms for abelian periods in words and greatest common divisor queries
- Efficient indexes for the positional pattern matching problem and two related problems over small alphabets
- \(k\)-abelian pattern matching
- CSA++: Fast Pattern Search for Large Alphabets
- Binary jumbled pattern matching on trees and tree-like structures
- Real-Time Streaming Multi-Pattern Search for Constant Alphabet
- Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings
- Algorithms for jumbled pattern matching in strings
- Efficient indexes for jumbled pattern matching with constant-sized alphabet
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)
