Pages that link to "Item:Q845893"
From MaRDI portal
The following pages link to Simple deterministic wildcard matching (Q845893):
Displaying 19 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)
- On string matching with mismatches (Q1736652) (← links)
- Streaming pattern matching with \(d\) wildcards (Q1741859) (← links)
- Verifiable pattern matching on outsourced texts (Q1757465) (← links)
- String indexing for patterns with wildcards (Q2254487) (← links)
- Elastic-Degenerate String Matching via Fast Matrix Multiplication (Q5864665) (← links)
