Permuted scaled matching
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3471577 (Why is no real title available?)
- scientific article; zbMATH DE number 3551946 (Why is no real title available?)
- A fast string searching algorithm
- Algorithms for jumbled pattern matching in strings
- Alphabet-Independent and Scaled Dictionary Matching
- Clustered Integer 3SUM via Additive Combinatorics
- Deterministic Sampling–A New Technique for Fast Pattern Matching
- Efficient indexes for jumbled pattern matching with constant-sized alphabet
- Efficient one-dimensional real scaled matching
- Efficient pattern matching with scaling
- Efficient randomized pattern-matching algorithms
- Efficient text fingerprinting via Parikh mapping
- Fast Pattern Matching in Strings
- Fast algorithms for abelian periods in words and greatest common divisor queries
- Faster two dimensional scaled matching
- Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence
- On approximate jumbled pattern matching in strings
- On hardness of jumbled indexing
- Permuted scaled matching
- Real scaled matching
- Real two dimensional scaled matching
- Scaled and permuted string matching
- Sub-quadratic time and linear space data structures for permutation matching in binary strings
- Time-space-optimal string matching
Cited in
(5)
This page was built for publication: Permuted scaled matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294926)