Pages that link to "Item:Q845893"
From MaRDI portal
The following pages link to Simple deterministic wildcard matching (Q845893):
Displayed 12 items.
- A new efficient indexing algorithm for one-dimensional real scaled patterns (Q414881) (← 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)
- The indexing for one-dimensional proportionally-scaled strings (Q1944891) (← links)
- Efficient and Secure Generalized Pattern Matching via Fast Fourier Transform (Q3011902) (← links)
- A Black Box for Online Approximate Pattern Matching (Q3506949) (← links)
- Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard (Q3637111) (← links)