Pages that link to "Item:Q845893"
From MaRDI portal
The following pages link to Simple deterministic wildcard matching (Q845893):
Displaying 33 items.
- Set intersection and sequence matching with mismatch counting (Q294918) (← links)
- On pattern matching with \(k\) mismatches and few don't cares (Q344551) (← links)
- A new efficient indexing algorithm for one-dimensional real scaled patterns (Q414881) (← links)
- An algorithmic toolbox for periodic partial words (Q477348) (← links)
- Necklaces, convolutions, and \(X+Y\) (Q517795) (← links)
- On the complexity of deciding avoidability of sets of partial words (Q606993) (← links)
- A black box for online approximate pattern matching (Q716330) (← links)
- A faster algorithm for the computation of string convolutions using LZ78 parsing (Q765493) (← links)
- Pattern matching with don't cares and few errors (Q847263) (← links)
- Matching with don't-cares and a small number of mismatches (Q976093) (← links)
- Hardness of comparing two run-length encoded strings (Q990818) (← links)
- Faster pattern matching with character classes using prime number encoding (Q1004281) (← links)
- A filtering algorithm for \(k\)-mismatch with don't cares (Q1675785) (← links)
- Pattern matching with wildcards using words of shorter length (Q1675874) (← links)
- Covering problems for partial words and for indeterminate strings (Q1676304) (← links)
- On string matching with mismatches (Q1736652) (← links)
- Streaming pattern matching with \(d\) wildcards (Q1741859) (← links)
- Verifiable pattern matching on outsourced texts (Q1757465) (← links)
- The indexing for one-dimensional proportionally-scaled strings (Q1944891) (← links)
- String indexing for patterns with wildcards (Q2254487) (← links)
- On the average-case complexity of pattern matching with wildcards (Q2672571) (← links)
- Efficient and Secure Generalized Pattern Matching via Fast Fourier Transform (Q3011902) (← links)
- Upper and Lower Bounds for Dynamic Data Structures on Strings (Q3304117) (← links)
- A Black Box for Online Approximate Pattern Matching (Q3506949) (← links)
- Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard (Q3637111) (← links)
- Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams (Q5002743) (← links)
- Longest common substring made fully dynamic (Q5075739) (← links)
- Hamming Distance Completeness (Q5088904) (← links)
- (Q5091170) (← links)
- Fast Convolutions of Packed Strings and Pattern Matching with Wildcards (Q5268397) (← links)
- Multi-pattern matching algorithm with wildcards based on bit-parallelism (Q5371909) (← links)
- Elastic-Degenerate String Matching via Fast Matrix Multiplication (Q5864665) (← links)
- Periodicity in data streams with wildcards (Q5915573) (← links)
