Simple deterministic wildcard matching
From MaRDI portal
Recommendations
- Pattern matching with arbitrary-length wildcards
- Pattern matching with wildcards using words of shorter length
- scientific article; zbMATH DE number 1497852
- Simple Optimal String Matching Algorithm
- Pattern matching with wildcards and length constraints using maximum network flow
- Streaming pattern matching with \(d\) wildcards
Cites work
Cited in
(36)- Longest common substring made fully dynamic
- scientific article; zbMATH DE number 2119723 (Why is no real title available?)
- New algorithms for pattern matching with wildcards and length constraints
- On the average-case complexity of pattern matching with wildcards
- Faster pattern matching with character classes using prime number encoding
- A new efficient indexing algorithm for one-dimensional real scaled patterns
- Towards optimal approximate streaming pattern matching by matching multiple patterns in multiple streams
- A black box for online approximate pattern matching
- scientific article; zbMATH DE number 3949728 (Why is no real title available?)
- Set intersection and sequence matching with mismatch counting
- Even faster elastic-degenerate string matching via fast matrix multiplication
- Verifiable pattern matching on outsourced texts
- A Black Box for Online Approximate Pattern Matching
- Pattern matching with wildcards using words of shorter length
- Hardness of comparing two run-length encoded strings
- Streaming pattern matching with \(d\) wildcards
- An algorithmic toolbox for periodic partial words
- On the complexity of deciding avoidability of sets of partial words
- Fast convolutions of packed strings and pattern matching with wildcards
- Elastic-Degenerate String Matching via Fast Matrix Multiplication
- The indexing for one-dimensional proportionally-scaled strings
- Hamming Distance Completeness
- Multi-pattern matching algorithm with wildcards based on bit-parallelism
- A faster algorithm for the computation of string convolutions using LZ78 parsing
- Efficient and secure generalized pattern matching via Fast Fourier Transform
- On pattern matching with \(k\) mismatches and few don't cares
- Matching with don't-cares and a small number of mismatches
- A simple obfuscation scheme for pattern-matching with wildcards
- Combinatorial algorithms for subsequence matching: a survey
- Pattern matching with don't cares and few errors
- Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard
- Approximate subset matching with don't cares
- Necklaces, convolutions, and \(X+Y\)
- A filtering algorithm for k-mismatch with don't cares
- Upper and lower bounds for dynamic data structures on strings
- On string matching with mismatches
This page was built for publication: Simple deterministic wildcard matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845893)
