Efficient indexes for jumbled pattern matching with constant-sized alphabet
From MaRDI portal
Publication:524375
DOI10.1007/s00453-016-0140-0zbMath1364.68381OpenAlexW2305526347WikidataQ59608981 ScholiaQ59608981MaRDI QIDQ524375
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter
Publication date: 2 May 2017
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-016-0140-0
Related Items (2)
Generating a Gray code for prefix normal words in amortized polylogarithmic time per word ⋮ Bubble-flip -- a new generation algorithm for prefix normal words
Cites Work
- Constrained multilinear detection and generalized graph motifs
- Fast construction of wavelet trees
- Indexing permutations for binary strings
- Sub-quadratic time and linear space data structures for permutation matching in binary strings
- Necklaces, convolutions, and \(X+Y\)
- On approximate jumbled pattern matching in strings
- Upper and lower bounds for finding connected motifs in vertex-colored graphs
- Scaled and permuted string matching
- Binary jumbled pattern matching on trees and tree-like structures
- Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet
- ALGORITHMS FOR JUMBLED PATTERN MATCHING IN STRINGS
- Clustered Integer 3SUM via Additive Combinatorics
- On the relationship between histogram indexing and block-mass indexing
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- On Hardness of Jumbled Indexing
- Faster all-pairs shortest paths via circuit complexity
- Wavelet Trees Meet Suffix Trees
This page was built for publication: Efficient indexes for jumbled pattern matching with constant-sized alphabet
