Efficient indexes for jumbled pattern matching with constant-sized alphabet
From MaRDI portal
Publication:524375
DOI10.1007/S00453-016-0140-0zbMATH Open1364.68381OpenAlexW2305526347WikidataQ59608981 ScholiaQ59608981MaRDI QIDQ524375FDOQ524375
Authors: 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
Recommendations
- Efficient indexes for jumbled pattern matching with constant-sized alphabet
- Efficient indexes for the positional pattern matching problem and two related problems over small alphabets
- Fast and simple jumbled indexing for binary run-length encoded strings
- On approximate jumbled pattern matching in strings
- Algorithms for jumbled pattern matching in strings
- scientific article; zbMATH DE number 2011852
- Efficient randomized pattern-matching algorithms
Cites Work
- Constrained multilinear detection and generalized graph motifs
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Upper and lower bounds for finding connected motifs in vertex-colored graphs
- Efficient indexes for jumbled pattern matching with constant-sized alphabet
- Algorithms for jumbled pattern matching in strings
- Clustered Integer 3SUM via Additive Combinatorics
- Fast construction of wavelet trees
- Sub-quadratic time and linear space data structures for permutation matching in binary strings
- On hardness of jumbled indexing
- Wavelet trees meet suffix trees
- On approximate jumbled pattern matching in strings
- Scaled and permuted string matching
- Faster all-pairs shortest paths via circuit complexity
- Indexing permutations for binary strings
- Binary jumbled pattern matching on trees and tree-like structures
- On the relationship between histogram indexing and block-mass indexing
- Necklaces, convolutions, and \(X+Y\)
Cited In (14)
- Bubble-flip -- a new generation algorithm for prefix normal words
- New algorithms for binary jumbled pattern matching
- Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
- Efficient indexes for jumbled pattern matching with constant-sized alphabet
- On approximate jumbled pattern matching in strings
- Fast and simple jumbled indexing for binary run-length encoded strings
- A Linear Size Index for Approximate Pattern Matching
- Efficient indexes for the positional pattern matching problem and two related problems over small alphabets
- On hardness of jumbled indexing
- CSA++: Fast Pattern Search for Large Alphabets
- 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
- Indexed geometric 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 Q524375)
