Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet
From MaRDI portal
Publication:2849352
DOI10.1007/978-3-642-40450-4_53zbMath1364.68380OpenAlexW161072239MaRDI QIDQ2849352
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
Related Items (9)
Weighted prefix normal words: mind the gap ⋮ Permuted scaled matching ⋮ Fast algorithms for abelian periods in words and greatest common divisor queries ⋮ Binary jumbled pattern matching on trees and tree-like structures ⋮ General space-time tradeoffs via relational queries ⋮ \(k\)-abelian pattern matching ⋮ Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings ⋮ Efficient indexes for jumbled pattern matching with constant-sized alphabet ⋮ On prefix normal words and prefix normal forms
This page was built for publication: Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet
